101 research outputs found
The excedances and descents of bi-increasing permutations
Starting from some considerations we make about the relations between certain
difference statistics and the classical permutation statistics we study
permutations whose inversion number and excedance difference coincide. It turns
out that these (so-called bi-increasing) permutations are just the 321-avoiding
ones. The paper investigates their excedance and descent structure. In
particular, we find some nice combinatorial interpretations for the
distribution coefficients of the number of excedances and descents,
respectively, and their difference analogues over the bi-increasing
permutations in terms of parallelogram polyominoes and 2-Motzkin paths. This
yields a connection between restricted permutations, parallelogram polyominoes,
and lattice paths that reveals the relations between several well-known
bijections given for these objects (e.g. by Delest-Viennot,
Billey-Jockusch-Stanley, Francon-Viennot, and Foata-Zeilberger). As an
application, we enumerate skew diagrams according to their rank and give a
simple combinatorial proof for a result concerning the symmetry of the joint
distribution of the number of excedances and inversions, respectively, over the
symmetric group.Comment: 36 page
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 pattern-avoiding permutations into classical
statistics on Dyck paths, whose distribution is easy to obtain.
We also present a generalization of the bijection, as well as several
applications of it to enumeration problems of statistics in restricted
permutations.Comment: 13 pages, 8 figures, submitted to Annals of Combinatoric
Continued fractions for permutation statistics
We explore a bijection between permutations and colored Motzkin paths that
has been used in different forms by Foata and Zeilberger, Biane, and Corteel.
By giving a visual representation of this bijection in terms of so-called cycle
diagrams, we find simple translations of some statistics on permutations (and
subsets of permutations) into statistics on colored Motzkin paths, which are
amenable to the use of continued fractions. We obtain new enumeration formulas
for subsets of permutations with respect to fixed points, excedances, double
excedances, cycles, and inversions. In particular, we prove that cyclic
permutations whose excedances are increasing are counted by the Bell numbers.Comment: final version formatted for DMTC
Classification of bijections between 321- and 132-avoiding permutations
It is well-known, and was first established by Knuth in 1969, that the number
of 321-avoiding permutations is equal to that of 132-avoiding permutations. In
the literature one can find many subsequent bijective proofs of this fact. It
turns out that some of the published bijections can easily be obtained from
others. In this paper we describe all bijections we were able to find in the
literature and show how they are related to each other via ``trivial''
bijections. We classify the bijections according to statistics preserved (from
a fixed, but large, set of statistics), obtaining substantial extensions of
known results. Thus, we give a comprehensive survey and a systematic analysis
of these bijections. We also give a recursive description of the algorithmic
bijection given by Richards in 1988 (combined with a bijection by Knuth from
1969). This bijection is equivalent to the celebrated bijection of Simion and
Schmidt (1985), as well as to the bijection given by Krattenthaler in 2001, and
it respects 11 statistics--the largest number of statistics any of the
bijections respects
- …