Geometric grid classes of permutations

DOI10.1090/S0002-9947-2013-05804-7zbMath1271.05004arXiv1108.6319MaRDI QIDQ2849033

M. D. Atkinson, Mathilde Bouvel, Michael Henry Albert, Vincent R. Vatter, Nikola Ruškuc

Publication date: 16 September 2013

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

rational generating functionsfinite sets of forbidden permutations

Mathematics Subject Classification ID

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

Related Items (30)

The enumeration of permutations avoiding 3124 and 4312 ⋮ The micro-world of cographs ⋮ Letter Graphs and Geometric Grid Classes of Permutations ⋮ Labelled well-quasi-order for permutation classes ⋮ Square permutations are typically rectangular ⋮ Characterising inflations of monotone grid classes of permutations ⋮ Permutation patterns in genome rearrangement problems: the reversal model ⋮ On cyclic Schur-positive sets of permutations ⋮ Rationality for subclasses of 321-avoiding permutations ⋮ Enumerating indices of Schubert varieties defined by inclusions ⋮ Grid classes and partial well order ⋮ Rooted forests that avoid sets of permutations ⋮ Automatic discovery of structural rules of permutation classes ⋮ Growth rates of geometric grid classes of permutations ⋮ Generating permutations with restricted containers ⋮ Schur-positive sets of permutations via products and grid classes ⋮ Arc permutations ⋮ An algorithm computing combinatorial specifications of permutation classes ⋮ Juxtaposing Catalan permutation classes with monotone ones ⋮ Unnamed Item ⋮ Letter graphs and geometric grid classes of permutations: characterization and recognition ⋮ On the effective and automatic enumeration of polynomial permutation classes ⋮ Unnamed Item ⋮ Letter graphs and modular decomposition ⋮ 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 ⋮ Hereditary classes of graphs: a parametric approach ⋮ On the centrosymmetric permutations in a class

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Excluded permutation matrices and the Stanley-Wilf conjecture
• On partial well-order for monotone grid classes of permutations
• Grid classes and partial well order
• The X-class and almost-increasing permutations
• On points drawn from a circle
• Partially well-ordered closed sets of permutations
• Combinatorics on traces
• Forbidden subsequences
• Permutations which are the union of an increasing and a decreasing subsequence
• Profile classes and partial well-order for permutations
• Regular closed sets of permutations.
• On growth rates of closed permutation classes
• Pattern classes of permutations via bijections between linearly ordered sets
• Grid classes and the Fibonacci dichotomy for restricted permutations
• Simple permutations and pattern restricted permutations
• Pattern avoidance classes and subpermutations
• A Survey of Simple Permutations
• Subclasses of the separable permutations
• Small permutation classes
• Ordering by Divisibility in Abstract Algebras
• Sur l'extension aux relations de quelques propriétés des ordres
• Restricted permutations

This page was built for publication: Geometric grid classes of permutations