Decomposing simple permutations, with enumerative consequences
- 1 July 2008
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 28 (4) , 385-400
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Simple permutations and algebraic generating functionsJournal of Combinatorial Theory, Series A, 2008
- Simple permutations: Decidability and unavoidable substructuresTheoretical Computer Science, 2008
- Simple permutations and pattern restricted permutationsDiscrete Mathematics, 2005
- Counting occurrences of 132 in an even permutationInternational Journal of Mathematics and Mathematical Sciences, 2004
- Enumeration of permutations containing a prescribed number of occurrences of a pattern of length threeAdvances in Applied Mathematics, 2003
- Counting occurrences of a pattern of type (1,2) or (2,1) in permutationsAdvances in Applied Mathematics, 2002
- Permutations with one or two 132-subsequencesDiscrete Mathematics, 1998
- Indecomposable graphsDiscrete Mathematics, 1997
- On Intervals in Relational StructuresMathematical Logic Quarterly, 1980
- Graph derivativesMathematische Zeitschrift, 1961