On growth rates of closed permutation classes
From MaRDI portal
Publication:1871365
zbMath1015.05002MaRDI QIDQ1871365
Publication date: 7 May 2003
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/122726
Related Items
Automatic discovery of structural rules of permutation classes, On the centrosymmetric permutations in a class, Wilf-collapse in permutation classes having two basis elements of size three, On the effective and automatic enumeration of polynomial permutation classes, An Algorithm to Enumerate Grid Signed Permutation Classes, Hereditary classes of ordered binary structures, A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs, Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns, Growth rates of geometric grid classes of permutations, The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns, Embedding dualities for set partitions and for relational structures, Intervals of permutation class growth rates, Finding regular insertion encodings for permutation classes, New records in Stanley-Wilf limits, Generalizations of Khovanskiĭ's theorems on the growth of sumsets in abelian semigroups, Growth constants of minor-closed classes of graphs, On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture, Composability of permutation classes, Generating permutations with restricted containers, On the least exponential growth admitting uncountably many closed permutation classes, Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile, Growth rates of permutation classes: categorization up to the uncountability threshold, On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia, The orbit algebra of an oligomorphic permutation group with polynomial profile is Cohen-Macaulay, \(k\)-pop stack sortable permutations and \(2\)-avoidance, Jumps in speeds of hereditary properties in finite relational languages, Classes of graphs without star forests and related graphs, Geometric grid classes of permutations
