Permutation classes
From MaRDI portal
Abstract: This is a survey on permutation classes for the upcoming book Handbook of Enumerative Combinatorics.
Recommendations
- Combinatorial specification of permutation classes
- Composability of permutation classes
- scientific article; zbMATH DE number 1943960
- Permutations
- Subclasses of the separable permutations
- scientific article; zbMATH DE number 1507230
- Permutability class of a semigroup
- Counting and generating permutations in regular classes
- Young classes of permutations
Cited in
(85)- On two-sided gamma-positivity for simple permutations
- The Brownian limit of separable permutations
- Characterising inflations of monotone grid classes of permutations
- A new occurrence of Catalan numbers: cap permutations
- Composability of permutation classes
- Generating permutations with restricted containers
- A counterexample regarding labelled well-quasi-ordering
- Supercritical sequences, and the nonrationality of most principal permutation classes
- Lower bounds for superpatterns and universal sequences
- Finding and counting permutations via CSPs
- Letter graphs and modular decomposition
- Almost square permutations are typically square
- Permutations avoiding sets of patterns with long monotone subsequences
- On pattern avoidance in matchings and involutions
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization
- Classical length-5 pattern-avoiding permutations
- On the poset of non-attacking King permutations
- Growth rates of permutation classes: categorization up to the uncountability threshold
- A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate
- Pattern avoiding permutations with a unique longest increasing subsequence
- Patterns of relation triples in inversion and ascent sequences
- Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
- Two first-order logics of permutations
- Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
- The operators F_i on permutations, 132-avoiding permutations and inversions
- Pattern avoidance in permutations and their squares
- Combinatorial specifications for juxtapositions of permutation classes
- Equivalence classes of permutations modulo excedances
- Longest monotone subsequences and rare regions of pattern-avoiding permutations
- Unsplittable classes of separable permutations
- Square permutations are typically rectangular
- Small permutation classes
- On -positive polynomials arising in pattern avoidance
- scientific article; zbMATH DE number 5667416 (Why is no real title available?)
- scientific article; zbMATH DE number 59348 (Why is no real title available?)
- Two permutation classes related to the bubble sort operator
- Expected patterns in permutation classes
- Letter graphs and geometric grid classes of permutations
- Bounded affine permutations. I: Pattern avoidance and enumeration
- Fillings of skew shapes avoiding diagonal patterns
- Two examples of Wilf-collapse
- On the dimension of downsets of integer partitions and compositions
- On the centrosymmetric permutations in a class
- An elementary proof of Bevan's theorem on the growth of grid classes of permutations
- An algorithm computing combinatorial specifications of permutation classes
- Wilf-collapse in permutation classes having two basis elements of size three
- Combinatorial specification of permutation classes
- Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations
- An exact characterization of saturation for permutation matrices
- On the effective and automatic enumeration of polynomial permutation classes
- An Algorithm to Enumerate Grid Signed Permutation Classes
- scientific article; zbMATH DE number 7765381 (Why is no real title available?)
- Some D-finite and some possibly D-finite sequences in the OEIS
- Hereditary classes of ordered binary structures
- A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs
- Burstein’s permutation conjecture, Hong and Li’s inversion sequence conjecture and restricted Eulerian distributions
- Hereditary classes of ordered sets of width at most two
- Generalized coloring of permutations
- A logical limit law for \(231\)-avoiding permutations
- Long increasing subsequences and non-algebraicity
- Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns
- Mini-workshop: Permutation patterns. Abstracts from the mini-workshop held January 28 -- February 2, 2024
- Computational complexity of counting coincidences
- Permutations avoiding bipartite partially ordered patterns have a regular insertion encoding
- Most principal permutation classes, and t-stack sortable permutations, have nonrational generating functions
- Thresholds for patterns in random permutations with a given number of inversions
- On the permutations that strongly avoid the pattern 312 or 231
- Decidability of well quasi-order and atomicity for equivalence relations under embedding orderings
- Enumeration of pattern-avoiding alternating sign matrices: an asymptotic dichotomy
- Minimal prime ages, words and permutation graphs
- Combinatorial exploration: an algorithmic framework for enumeration
- Completing the enumeration of inversion sequences avoiding one or two patterns of length 3
- Maximal number of subword occurrences in a word
- Enumerating 1324-avoiders with few inversions
- Separable elements and splittings in Weyl groups of type B
- On a conjecture about pattern avoidance of cyclic permutations
- Between weak and Bruhat: the middle order on permutations
- Decidability in geometric grid classes of permutations
- Enumerating polynomial colored permutation classes
- First-order convergence for 321-avoiding permutations
- On the asymptotic enumeration and limit shapes of monotone grid classes of permutations
- Stack-sorting preimages and 0-1-trees
- Boolean-Narayana numbers
- Bounded affine permutations. II: Avoidance of decreasing patterns
This page was built for publication: Permutation classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949156)
