Young classes of permutations

MaRDI QIDQ2869458zbMATH OpenFDO

Authors Michael Albert

Publication date 3 January 2014

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1008.4615

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: 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.

Recommendations

• Permutation classes of polynomial growth
• Sorting classes
• On growth rates of closed permutation classes
• Ascending subsequences of permutations and the shapes of tableaux
• Small permutation classes

Cited in

(5)

• Permutation classes
• Finding the permutations corresponding to a given Young tableau
• Sorting classes
• Small permutation classes
• The dominance order for permutations

This page was built for publication: Young classes of permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869458)