Simple permutations and pattern restricted permutations

2005/08/26 by Michael Albert, M.H. Albert, M.D. Atkinson +1 · 23 citations
Mathematics · Computer Science · #Advanced Combinatorial Mathematics #semigroups and automata theory #Coding theory and cryptography

paper · doi:10.1016/j.disc.2005.06.016

Cited by

• The enumeration of three pattern classes
• Characterising inflations of monotone grid classes of permutations
• Simple permutations: decidability and unavoidable substructures
• Deflatability of Permutation Classes
• Sub-families of Baxter Permutations Based on Pattern Avoidance
• An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
• A stack and a pop stack in series
• Inflations of geometric grid classes of permutations
• Wreath Products of Permutation Classes
• The insertion encoding of restricted growth functions
• 2-stack pushall sortable permutations
• Grid classes and the Fibonacci dichotomy for restricted permutations
• The fine structure of the sets of involutions avoiding 4321 or 3412
• Grid classes and partial well order
• On the effective and automatic enumeration of polynomial permutation\n classes
• Pattern-Avoiding Involutions: Exact and Asymptotic Enumeration
• Intervals of permutations and the principal Möbius function
• On 021-Avoiding Ascent Sequences
• Sperner's colorings of hypergraphs arising from edgewise triangulations
• The enumeration of permutations avoiding 2143 and 4231
• A counterexample to a Gröbner approach for noetherianity of the twisted commutative algebra \rm Sym(\rm Sym²(C^∞))
• Counting (3+1) - Avoiding permutations
• Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [europepmc]