The enumeration of three pattern classes using monotone grid classes
From MaRDI portal
Summary: The structure of the three pattern classes defined by the sets of forbidden permutations \(\{2143, 4321\}, \{2143, 4312\}\) and \(\{1324, 4312\}\) is determined using the machinery of monotone grid classes. This allows the permutations in these classes to be described in terms of simple diagrams and regular languages and, using this, the rational generating functions which enumerate these classes are determined.
Recommendations
- Characterising inflations of monotone grid classes of permutations
- Grid classes and the Fibonacci dichotomy for restricted permutations
- Classification of certain subgraphs of the 3‐dimensional grid
- Enumeration of cyclic permutations in vector grid classes
- On monochromatic subsets of a rectangular grid
- On partial well-order for monotone grid classes of permutations
- Monotone triangles and 312 pattern avoidance
- Enumeration by stabilizer class of patterns with local restrictions
- Geometric grid classes of permutations
- 2 2 monotone grid classes are finitely based
Cited in
(19)- Characterising inflations of monotone grid classes of permutations
- Generating and enumerating 321-avoiding and skew-merged simple permutations
- On Vietoris-Rips complexes of hypercube graphs
- Universal limits of substitution-closed permutation classes
- Combinatorial specifications for juxtapositions of permutation classes
- Enumeration of cyclic permutations in vector grid classes
- The enumeration of permutations avoiding 3124 and 4312
- Enumerating indices of Schubert varieties defined by inclusions
- The permutation classes \(\mathrm{Av}(1234, 2341)\) and \(\mathrm{Av}(1243, 2314)\)
- 2 2 monotone grid classes are finitely based
- Growth rates of geometric grid classes of permutations
- Using large random permutations to partition permutation classes
- On the centrosymmetric permutations in a class
- Growth rates of permutation grid classes, tours on graphs, and the spectral radius
- Juxtaposing Catalan permutation classes with monotone ones
- Patterns in random permutations avoiding the pattern 132
- Enumeration of pin-permutations
- The enumeration of three pattern classes
- Combinatorial exploration: an algorithmic framework for enumeration
This page was built for publication: The enumeration of three pattern classes using monotone grid classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456342)
