The Open UniversitySkip to content
 

Decomposing simple permutations, with enumerative consequences

Brignall, Robert; Huczynska, Sophie and Vatter, Vincent (2008). Decomposing simple permutations, with enumerative consequences. Combinatorica, 28(4) pp. 385–400.

DOI (Digital Object Identifier) Link: http://dx.doi.org/10.1007/s00493-008-2314-0
Google Scholar: Look up in Google Scholar

Abstract

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).

Item Type: Journal Article
Copyright Holders: 2008 János Bolyai Mathematical Society and Springer-Verlag
ISSN: 1439-6912
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Item ID: 23473
Depositing User: Robert Brignall
Date Deposited: 13 Oct 2010 16:02
Last Modified: 05 Dec 2012 15:32
URI: http://oro.open.ac.uk/id/eprint/23473
Share this page:

Actions (login may be required)

View Item
Report issue / request change

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk