Permutation classes
From MaRDI portal
Publication:2949156
zbMath1353.05010arXiv1409.5159MaRDI QIDQ2949156
Publication date: 7 October 2015
Full work available at URL: https://arxiv.org/abs/1409.5159
Related Items (51)
On pattern avoidance in matchings and involutions ⋮ An exact characterization of saturation for permutation matrices ⋮ Bounded affine permutations. II: Avoidance of decreasing patterns ⋮ Letter Graphs and Geometric Grid Classes of Permutations ⋮ Unsplittable classes of separable permutations ⋮ On two-sided gamma-positivity for simple permutations ⋮ On \(\gamma\)-positive polynomials arising in pattern avoidance ⋮ 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 ⋮ The Brownian limit of separable permutations ⋮ Square permutations are typically rectangular ⋮ Longest monotone subsequences and rare regions of pattern-avoiding permutations ⋮ On the poset of non-attacking King permutations ⋮ Characterising inflations of monotone grid classes of permutations ⋮ Growth rates of permutation classes: categorization up to the uncountability threshold ⋮ An Algorithm to Enumerate Grid Signed Permutation Classes ⋮ A new occurrence of Catalan numbers: cap permutations ⋮ A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Pattern avoiding permutations with a unique longest increasing subsequence ⋮ Composability of permutation classes ⋮ Bounded affine permutations I. Pattern avoidance and enumeration ⋮ Two examples of Wilf-collapse ⋮ Fillings of skew shapes avoiding diagonal patterns ⋮ Generating permutations with restricted containers ⋮ An algorithm computing combinatorial specifications of permutation classes ⋮ A counterexample regarding labelled well-quasi-ordering ⋮ Supercritical sequences, and the nonrationality of most principal permutation classes ⋮ Wilf-collapse in permutation classes having two basis elements of size three ⋮ Patterns of relation triples in inversion and ascent sequences ⋮ On the effective and automatic enumeration of polynomial permutation classes ⋮ Lower bounds for superpatterns and universal sequences ⋮ Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\) ⋮ Finding and counting permutations via CSPs ⋮ Two first-order logics of permutations ⋮ Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences ⋮ Letter graphs and modular decomposition ⋮ The operators \(F_i\) on permutations, 132-avoiding permutations and inversions ⋮ An Elementary Proof of Bevan's Theorem on the Growth of Grid Classes of Permutations ⋮ Almost square permutations are typically square ⋮ Pattern avoidance in permutations and their squares ⋮ Combinatorial specifications for juxtapositions of permutation classes ⋮ Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations ⋮ Permutations avoiding sets of patterns with long monotone subsequences ⋮ On the dimension of downsets of integer partitions and compositions ⋮ On the centrosymmetric permutations in a class
Uses Software
This page was built for publication: Permutation classes
