Simple permutations and pattern restricted permutations
From MaRDI portal
Publication:2570099
DOI10.1016/j.disc.2005.06.016zbMath1073.05002OpenAlexW1981803420MaRDI QIDQ2570099
M. D. Atkinson, Michael Henry Albert
Publication date: 26 October 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.06.016
Related Items (55)
Decomposing inversion sets of permutations and applications to faces of the Littlewood-Richardson cone ⋮ Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers ⋮ The enumeration of permutations avoiding 3124 and 4312 ⋮ AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS ⋮ Labelled well-quasi-order for permutation classes ⋮ Decomposing simple permutations, with enumerative consequences ⋮ On two-sided gamma-positivity for simple permutations ⋮ Scaling limits of permutation classes with a finite specification: a dichotomy ⋮ The Brownian limit of separable permutations ⋮ Block decomposition of permutations and Schur-positivity ⋮ Characterising inflations of monotone grid classes of permutations ⋮ Some families of trees arising in permutation analysis ⋮ Pairs of orthogonal countable ordinals ⋮ Substitution-closed pattern classes ⋮ Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Rationality for subclasses of 321-avoiding permutations ⋮ Simple permutations and algebraic generating functions ⋮ Symmetric maximal Condorcet domains ⋮ Formulae and Asymptotics for Coefficients of Algebraic Functions ⋮ A general theory of Wilf-equivalence for Catalan structures ⋮ Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile ⋮ Grid classes and partial well order ⋮ Counting \(\mathbf {(3+1)}\)-avoiding permutations ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ Universal limits of substitution-closed permutation classes ⋮ Operators of equivalent sorting power and related Wilf-equivalences ⋮ Limit densities of patterns in permutation inflations ⋮ Automatic discovery of structural rules of permutation classes ⋮ Splittings and Ramsey properties of permutation classes ⋮ Block numbers of permutations and Schur-positivity ⋮ Simple permutations: Decidability and unavoidable substructures ⋮ Countable linear orders with disjoint infinite intervals are mutually orthogonal ⋮ An algorithm computing combinatorial specifications of permutation classes ⋮ An algorithm for deciding the finiteness of the number of simple permutations in permutation classes ⋮ Subclasses of Baxter Permutations Based on Pattern Avoidance ⋮ Small configurations in simple permutations ⋮ Rationality of the Möbius function of a composition poset ⋮ Enumeration Schemes for Restricted Permutations ⋮ On the effective and automatic enumeration of polynomial permutation classes ⋮ 2413-balloon permutations and the growth of the Möbius function ⋮ Permutations avoiding certain partially-ordered patterns ⋮ Average-Case Analysis of Perfect Sorting by Reversals ⋮ ZEROS OF THE MÖBIUS FUNCTION OF PERMUTATIONS ⋮ Orthogonal countable linear orders ⋮ PERMUTATION CLASSES OF EVERY GROWTH RATE ABOVE 2.48188 ⋮ Combinatorial specifications for juxtapositions of permutation classes ⋮ A decorated tree approach to random permutations in substitution-closed classes ⋮ Geometric grid classes of permutations ⋮ Interval posets of permutations ⋮ Inflations of geometric grid classes of permutations ⋮ Equipopularity classes in the separable permutations ⋮ The feasible regions for consecutive patterns of pattern-avoiding permutations ⋮ Well-quasi-order for permutation graphs omitting a path and a clique ⋮ From Hertzsprung's problem to pattern-rewriting systems ⋮ Homomorphic image orders on combinatorial structures.
Cites Work
- Unnamed Item
- Partially well-ordered closed sets of permutations
- Forbidden subsequences and Chebyshev polynomials
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Permutations which are the union of an increasing and a decreasing subsequence
- Vexillary involutions are enumerated by Motzkin numbers
- Restricted permutations and the wreath product
- Restricted permutations and Chebyshev polynomials
- Generating trees and the Catalan and Schröder numbers
- Permutations with forbidden subsequences and a generalized Schröder number
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Ordering by Divisibility in Abstract Algebras
- Restricted permutations
- Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
This page was built for publication: Simple permutations and pattern restricted permutations
