The insertion encoding of permutations
From MaRDI portal
Publication:2571290
zbMath1081.05001MaRDI QIDQ2571290
Nikola Ruškuc, Steve Linton, Michael Henry Albert
Publication date: 1 November 2005
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/125568
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Formal languages and automata (68Q45)
Related Items (22)
Growth rates of permutation classes: categorization up to the uncountability threshold ⋮ Algorithmic coincidence classification of mesh patterns ⋮ Refining enumeration schemes to count according to permutation statistics ⋮ A bijection for length-5 patterns in permutations ⋮ A bijection between evil-avoiding and rectangular permutations ⋮ Repetition in reduced decompositions ⋮ Automatic discovery of structural rules of permutation classes ⋮ Finitely labeled generating trees and restricted permutations ⋮ Generating permutations with restricted containers ⋮ Simple permutations: Decidability and unavoidable substructures ⋮ On convex permutations ⋮ On the growth of merges and staircases of permutation classes ⋮ On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia ⋮ Unnamed Item ⋮ The enumeration of permutations sortable by pop stacks in parallel ⋮ On the effective and automatic enumeration of polynomial permutation classes ⋮ Enumerating permutations sortable by \(k\) passes through a pop-stack ⋮ Enumerating permutations sortable by \(k\) passes through a pop-stack ⋮ Finding regular insertion encodings for permutation classes ⋮ Permutation patterns and cell decompositions ⋮ Combinatorial specifications for juxtapositions of permutation classes ⋮ Permutations generated by a depth 2 stack and an infinite stack in series are algebraic
This page was built for publication: The insertion encoding of permutations
