Geometric grid classes of permutations
From MaRDI portal
Abstract: A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods, we prove that such classes are specified by finite sets of forbidden permutations, are partially well ordered, and have rational generating functions. Furthermore, we show that these properties are inherited by the subclasses (under permutation involvement) of such classes, and establish the basic lattice theoretic properties of the collection of all such subclasses.
Recommendations
- Inflations of geometric grid classes of permutations
- Letter graphs and geometric grid classes of permutations
- Geometric permutations
- Geometric sets of permutations
- Growth rates of geometric grid classes of permutations
- Enumeration of cyclic permutations in vector grid classes
- Grid classes and the Fibonacci dichotomy for restricted permutations
- Geometric permutations and two applications
- Letter graphs and geometric grid classes of permutations: characterization and recognition
Cites work
- A survey of simple permutations
- Analytic combinatorics
- Combinatorics on traces
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Forbidden subsequences
- Grid classes and partial well order
- Grid classes and the Fibonacci dichotomy for restricted permutations
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- On growth rates of closed permutation classes
- On partial well-order for monotone grid classes of permutations
- On points drawn from a circle
- Ordering by Divisibility in Abstract Algebras
- Partially well-ordered closed sets of permutations
- Pattern avoidance classes and subpermutations
- Pattern classes of permutations via bijections between linearly ordered sets
- 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.
- Restricted permutations
- Simple permutations and pattern restricted permutations
- Small permutation classes
- Subclasses of the separable permutations
- Sur l'extension aux relations de quelques propriétés des ordres
- The X-class and almost-increasing permutations
Cited in
(45)- Characterising inflations of monotone grid classes of permutations
- Rooted forests that avoid sets of permutations
- Generating permutations with restricted containers
- Letter graphs and modular decomposition
- Hereditary classes of graphs: a parametric approach
- Permutation patterns in genome rearrangement problems: the reversal model
- On cyclic Schur-positive sets of permutations
- Arc permutations
- Combinatorial specifications for juxtapositions of permutation classes
- Enumeration of cyclic permutations in vector grid classes
- Inflations of geometric grid classes of permutations
- Well-quasi-order for permutation graphs omitting a path and a clique
- The enumeration of permutations avoiding 3124 and 4312
- Rationality for subclasses of 321-avoiding permutations
- Enumerating indices of Schubert varieties defined by inclusions
- Grid classes and the Fibonacci dichotomy for restricted permutations
- Square permutations are typically rectangular
- 2 2 monotone grid classes are finitely based
- The enumeration of three pattern classes using monotone grid classes
- Automatic discovery of structural rules of permutation classes
- Growth rates of geometric grid classes of permutations
- Letter graphs and geometric grid classes of permutations
- Labelled well-quasi-order for permutation classes
- scientific article; zbMATH DE number 7559423 (Why is no real title available?)
- Schur-positivity via products of grid classes
- Schur-positive sets of permutations via products and grid classes
- On the centrosymmetric permutations in a class
- Growth rates of permutation grid classes, tours on graphs, and the spectral radius
- An algorithm computing combinatorial specifications of permutation classes
- Juxtaposing Catalan permutation classes with monotone ones
- Combinatorial generation via permutation languages. I: Fundamentals
- Letter graphs and geometric grid classes of permutations: characterization and recognition
- On the effective and automatic enumeration of polynomial permutation classes
- On partial well-order for monotone grid classes of permutations
- Grid classes and partial well order
- An antichain of monomial ideals in a twisted commutative algebra
- Deciding atomicity of subword-closed languages
- Sorting via shuffles with a cut after the longest increasing prefix
- Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024
- Bounds on the lettericity of graphs
- Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
- Decidability in geometric grid classes of permutations
- Enumerating polynomial colored permutation classes
- On the asymptotic enumeration and limit shapes of monotone grid classes of permutations
- The micro-world of cographs
This page was built for publication: Geometric grid classes of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849033)
