![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Partial Rank Symmetry of Distributive Lattices for Fences
Associated with any composition \(\beta =(a,b,\ldots )\) β = ...
-
Article
The Degree of Symmetry of Lattice Paths
The degree of symmetry of a combinatorial object, such as a lattice path, is a measure of how symmetric the object is. It typically ranges from zero, if the object is completely asymmetric, to its size, if it ...
-
Chapter and Conference Paper
Enumerating Descents on Quasi-Stirling Permutations and Plane Trees
Gessel and Stanley introduced Stirling permutations to give a combinatorial interpretation of certain polynomials related to Stirling numbers. A natural extension of these permutations are quasi-Stirling permu...
-
Article
Schur-positive sets of permutations via products and grid classes
Characterizing sets of permutations whose associated quasisymmetric function is symmetric and Schur-positive is a long-standing problem in algebraic combinatorics. In this paper, we present a general method to...
-
Article
A Generating Tree Approach to k-Nonnesting Partitions and Permutations
We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature which uses the connections of these obje...
-
Chapter
A survey of consecutive patterns in permutations
A consecutive pattern in a permutation π is another permutation σ ...
-
Article
Arc permutations
Arc permutations and unimodal permutations were introduced in the study of triangulations and characters. This paper studies combinatorial properties and structures on these permutations. First, both sets are ...
-
Article
Restricted Simsun Permutations
A permutation is simsun if for all k, the subword of the one-line notation consisting of the k smallest entries does not have three consecutive decreasing elements. Simsun permutations were introduced by Simion a...
-
Article
The X-Class and Almost-Increasing Permutations
In this paper we give a bijection between the class of permutations that can be drawn on an X-shape and a certain set of permutations that appears in Knuth [4] in connection to sorting algorithms. A natural gener...
-
Article
Generating Trees for Permutations Avoiding Generalized Patterns
We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of lengths 3 and 4. These trees are built by adding at each level an entry to the ri...
-
Article
A Simple and Unusual Bijection for Dyck Paths and its Consequences
In this paper we introduce a new bijection from the set of Dyck paths to itself. This bijection has the property that it maps statistics that appeared recently in the study of patternavoiding permutations into...