On the effective and automatic enumeration of polynomial permutation classes
From MaRDI portal
Publication:5963395
DOI10.1016/j.jsc.2015.11.019zbMath1331.05016arXiv1308.4946OpenAlexW2167190263MaRDI QIDQ5963395
Vincent R. Vatter, Cheyne Homberger
Publication date: 19 February 2016
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.4946
Related Items
Letter Graphs and Geometric Grid Classes of Permutations, Prolific permutations, Permutation patterns in genome rearrangement problems: the reversal model, An Algorithm to Enumerate Grid Signed Permutation Classes, Automatic discovery of structural rules of permutation classes, Generating permutations with restricted containers, Wilf-collapse in permutation classes having two basis elements of size three
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sorting permutations by block-interchanges
- Finding regular insertion encodings for permutation classes
- On growth rates of closed permutation classes
- Simple permutations and algebraic generating functions
- Permutation classes of polynomial growth
- Short proofs for cut-and-paste sorting of permutations
- Grid classes and the Fibonacci dichotomy for restricted permutations
- Simple permutations and pattern restricted permutations
- The insertion encoding of permutations
- Geometric grid classes of permutations
- Permutation classes
- Overview of some general results in combinatorial enumeration
- Sorting by Transpositions
- Combinatorial specification of permutation classes
- Ordering by Divisibility in Abstract Algebras