Projects per year
Abstract
We prove that evely sufficiently long simple permutation contains two long almost disjoint simple subsequence, and then we show how this result has enumerative consequences. For example it, implies that, for any gamma(1) the number of permutations with at most r copies of 132 has an algebraic generating function (this was previously proved, constructively, by Bona and (independently) Mansour and Vainshtein).
Original language | English |
---|---|
Pages (from-to) | 385-400 |
Number of pages | 16 |
Journal | Combinatorica |
Volume | 28 |
Issue number | 4 |
DOIs | |
Publication status | Published - Jul 2008 |
Keywords
- COUNTING OCCURRENCES
- RESTRICTED PERMUTATIONS
- PRESCRIBED NUMBER
- PATTERN
- 132-SUBSEQUENCES
Fingerprint
Dive into the research topics of 'Decomposing simple permutations with enumerative consequences'. Together they form a unique fingerprint.Projects
- 1 Finished
-
EPSRC GR/S53503/01: Applications of Automata and Languages in the Theory of Pattern Classes of Permutations
Ruskuc, N. (PI), Linton, S. A. (CoI) & Robertson, E. F. (CoI)
1/02/04 → 31/01/07
Project: Standard