Grid classes and the Fibonacci dichotomy for restricted permutations

zbMath1098.05003arXivmath/0602143MaRDI QIDQ2500973

Vincent R. Vatter, Sophie Huczynska

Publication date: 30 August 2006

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0602143

zbMATH Keywords

Fibonacci numberpermutation classes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)

Related Items (22)

Letter Graphs and Geometric Grid Classes of Permutations ⋮ Labelled well-quasi-order for permutation classes ⋮ Fibonacci numbers, consecutive patterns, and inverse peaks ⋮ Square permutations are typically rectangular ⋮ Prolific permutations ⋮ Characterising inflations of monotone grid classes of permutations ⋮ Classes of graphs without star forests and related graphs ⋮ An Algorithm to Enumerate Grid Signed Permutation Classes ⋮ Grid classes and partial well order ⋮ Generalizations of Khovanskiĭ's theorems on the growth of sumsets in abelian semigroups ⋮ Automatic discovery of structural rules of permutation classes ⋮ Generating permutations with restricted containers ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Intervals of permutation class growth rates ⋮ Wilf-collapse in permutation classes having two basis elements of size three ⋮ On the effective and automatic enumeration of polynomial permutation classes ⋮ Finding regular insertion encodings for permutation classes ⋮ Geometric grid classes of permutations ⋮ Growth rates of permutation grid classes, tours on graphs, and the spectral radius ⋮ Inflations of geometric grid classes of permutations ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ Well-quasi-order for permutation graphs omitting a path and a clique

This page was built for publication: Grid classes and the Fibonacci dichotomy for restricted permutations