• Corpus ID: 119462510

Andre' permutations, right-to-left and left-to-right minima

  title={Andre' permutations, right-to-left and left-to-right minima},
  author={Filippo Disanto},
  journal={arXiv: Combinatorics},
  • F. Disanto
  • Published 6 February 2012
  • Mathematics
  • arXiv: Combinatorics
We provide enumerative results concerning right-to-left minima and left- to-right minima in Andre' permutations of the first and second kind. For both the two kinds, the distribution of right-to-left and left-to-right minima is the same. We provide generating functions and associated asymptotics results. Our approach is based on the tree-structure of Andre' permutations. 
3 Citations

Figures from this paper

The Peak Statistics on Simsun Permutations
Property of the generating polynomials, including the recurrence relation, generating function and real-rootedness are studied and simsun permutations of the second kind are introduced.
A combinatorial model for the transition matrix between the Specht and web bases
This work provides a combinatorial interpretation for entries of the transition matrix between the Specht and web bases, which answers Rhoades’s question.


Cycle-up-down permutations
It is proved bijectively and analytically that these permutations are enumerated by the Euler numbers, and the distribution of some statistics on them, as well as on up-down permutations, on all permutation, and on a generalization of cycle-up- down permutations.
Some polynomials associated with up-down permutations
On thecd-variation polynomials of André and simsun permutations
  • G. Hetyei
  • Mathematics
    Discret. Comput. Geom.
  • 1996
A new signed generalization of André permutations is given, together with a new notion ofcd-variation for signed permutations, that allows us to compute thecd-index of the face poset of a cube.
Permutation Trees and Variation Statistics
This paper exploits binary tree representations of permutations to give a combinatorial proof of Purtill's result 8 that???Anvcd(?)?c=a+bd=ab+ba=???Snvab(?), and introduces a new `Foata?Strehl-like? action on permutations.
Counting Simsun Permutations by Descents
We count in the present work simsun permutations of length n by their number of descents. Properties studied include the recurrence relation and real-rootedness of the generating function of the
ECO:a methodology for the enumeration of combinatorial objects
In this Paper, we illustrate a method (called the ECO method) for enumerating some classes of combinatorial objects. The basic idea of this method is the following: by means of an operator that
Varieties of Increasing Trees
An increasing tree is a labelled rooted tree in which labels along any branch from the root go in increasing order. Under various guises, such trees have surfaced as tree representations of
Analytic Combinatorics
This text can be used as the basis for an advanced undergraduate or a graduate course on the subject, or for self-study, and is certain to become the definitive reference on the topic.