Decomposing simple permutations, with enumerative consequences
- 68 Downloads
We prove that every sufficiently long simple permutation contains two long almost disjoint simple subsequences, and then we show how this result has enumerative consequences. For example, it implies that, for any r, the number of permutations with at most r copies of 132 has an algebraic generating function (this was previously proved, constructively, by Bóna and (independently) Mansour and Vainshtein).
Mathematics Subject Classification (2000)05D99 05A15 06A07
Unable to display preview. Download preview PDF.
- M. H. Albert, M. D. Atkinson and M. Klazar: The enumeration of simple permutations, J. Integer Seq. 6(4) (2003), Article 03.4.4, 18 pp. (electronic).Google Scholar
- E. Babson and E. Steingrímsson: Generalized permutation patterns and a classification of the Mahonian statistics, Sém. Lothar. Combin. 44 (2000), Art. B44b, 18 pp. (electronic).Google Scholar
- S. Corteel, G. Louchard and R. Pemantle: Common intervals of permutations, in Mathematics and computer science, III, Trends Math., Birkhäuser, Basel, 2004, pp. 3–14.Google Scholar