arXiv Analytics

Sign in

arXiv:1008.4615 [math.CO]AbstractReferencesReviewsResources

Young classes of permutations

Michael Albert

Published 2010-08-26, updated 2012-04-17Version 4

We characterise those classes of permutations having the property that for every tableau shape either every permutation of that shape or no permutation of that shape belongs to the class. The characterisation is in terms of the dominance order for partitions (and their conjugates) and shows that for any such class there is a constant k such that no permutation in the class can contain both an increasing and a decreasing sequence of length k.

Comments: 11 pages, this is the final version as accepted by the Australasian Journal of Combinatorics. Some more minor typos have been corrected
Categories: math.CO
Subjects: 05A05, 05A17, 05E99
Related articles: Most relevant | Search more
arXiv:0803.3706 [math.CO] (Published 2008-03-26, updated 2009-10-02)
On bijections between 231-avoiding permutations and Dyck paths
arXiv:1401.2691 [math.CO] (Published 2014-01-13)
The Location of the First Ascent in a 123-Avoiding Permutation
arXiv:1306.5926 [math.CO] (Published 2013-06-25, updated 2014-04-02)
On the Möbius Function of Permutations With One Descent

Links

Toolbox