Abstract
We investigate the structure of the two permutation classes defined by the sets of forbidden patterns {1234, 2341} and {1243, 2314}. By considering how the Hasse graphs of permutations in these classes can be built from a sequence of rooted source graphs, we determine their algebraic generating functions. Our approach is similar to that of “adding a slice”, used previously to enumerate various classes of polyominoes and other combinatorial structures. To solve the relevant functional equations, we make extensive use of the kernel method.
| Original language | English |
|---|---|
| Pages (from-to) | 3–20 |
| Number of pages | 18 |
| Journal | Australasian Journal of Combinatorics |
| Volume | 64 |
| Publication status | Published - 29 Feb 2016 |
Keywords
- permutation classes
- kernel method
- Hasse graphs
Fingerprint
Dive into the research topics of 'The permutation classes Av(1234,2341) and Av(1243,2314)'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver