Simple permutations and pattern restricted permutations
From MaRDI portal
Publication:2570099
Recommendations
- scientific article; zbMATH DE number 3895076
- Restricted permutations
- Restricted permutations
- scientific article; zbMATH DE number 2186865
- Compositions of pattern restricted sets of permutations
- scientific article; zbMATH DE number 3627190
- The patterns of permutations
- scientific article; zbMATH DE number 1504635
- Permutations with Restricted Position
- Permutation tableaux and permutation patterns
Cites work
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Forbidden subsequences and Chebyshev polynomials
- Generating trees and the Catalan and Schröder numbers
- scientific article; zbMATH DE number 2186865 (Why is no real title available?)
- Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
- Ordering by Divisibility in Abstract Algebras
- Partially well-ordered closed sets of permutations
- Permutations which are the union of an increasing and a decreasing subsequence
- Permutations with forbidden subsequences and a generalized Schröder number
- Restricted permutations
- Restricted permutations and Chebyshev polynomials
- Restricted permutations and the wreath product
- Vexillary involutions are enumerated by Motzkin numbers
Cited in
(92)- On two-sided gamma-positivity for simple permutations
- The Brownian limit of separable permutations
- Block decomposition of permutations and Schur-positivity
- Characterising inflations of monotone grid classes of permutations
- Block numbers of permutations and Schur-positivity
- Generating permutations with restricted containers
- Countable linear orders with disjoint infinite intervals are mutually orthogonal
- Restricted permutations and the wreath product
- Restricted 1-3-2 permutations and generalized patterns
- Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
- Generating and enumerating 321-avoiding and skew-merged simple permutations
- Permutations with restricted movement
- Permutations avoiding certain partially-ordered patterns
- Interval posets of permutations
- The feasible regions for consecutive patterns of pattern-avoiding permutations
- From Hertzsprung's problem to pattern-rewriting systems
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Some families of trees arising in permutation analysis
- Universal limits of substitution-closed permutation classes
- Limit densities of patterns in permutation inflations
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
- 2413-balloon permutations and the growth of the Möbius function
- Orthogonal countable linear orders
- Permutation patterns and cell decompositions
- Combinatorial specifications for juxtapositions of permutation classes
- Inflations of geometric grid classes of permutations
- Equipopularity classes in the separable permutations
- Well-quasi-order for permutation graphs omitting a path and a clique
- Isomorphisms between pattern classes
- Homomorphic image orders on combinatorial structures.
- Decomposing inversion sets of permutations and applications to faces of the Littlewood-Richardson cone
- The enumeration of permutations avoiding 3124 and 4312
- Decomposing simple permutations, with enumerative consequences
- Rationality for subclasses of 321-avoiding permutations
- Simple permutations and algebraic generating functions
- Permutation classes of polynomial growth
- Pattern classes of permutations via bijections between linearly ordered sets
- Simple permutations: Decidability and unavoidable substructures
- Restricted signed permutations counted by the Schröder numbers
- Rationality of the Möbius function of a composition poset
- Simple permutations mix well
- Prolific permutations
- Geometric grid classes of permutations
- Average-case analysis of perfect sorting by reversals
- scientific article; zbMATH DE number 2186865 (Why is no real title available?)
- A survey of simple permutations
- Subclasses of the separable permutations
- PERMUTATION CLASSES OF EVERY GROWTH RATE ABOVE 2.48188
- Genealogy of simple permutations with order a power of two
- Average-Case Analysis of Perfect Sorting by Reversals
- Pairs of orthogonal countable ordinals
- Right-jumps and pattern avoiding permutations
- A survey of the algorithmic aspects of modular decomposition
- Automatic discovery of structural rules of permutation classes
- Operators of equivalent sorting power and related Wilf-equivalences
- Splittings and Ramsey properties of permutation classes
- Labelled well-quasi-order for permutation classes
- Zeros of the Möbius function of permutations
- Pattern popularity in multiply restricted permutations
- An algorithm computing combinatorial specifications of permutation classes
- Compositions of pattern restricted sets of permutations
- Formulae and asymptotics for coefficients of algebraic functions
- Enumeration of pin-permutations
- Enumeration Schemes for Restricted Permutations
- Subclasses of Baxter permutations based on pattern avoidance
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- On the effective and automatic enumeration of polynomial permutation classes
- Exact-Size Sampling of Enriched Trees in Linear Time
- Symmetric maximal Condorcet domains
- Substitution-closed pattern classes
- Grid classes and partial well order
- Counting \(\mathbf {(3+1)}\)-avoiding permutations
- Algebras, Graphs and Ordered Sets – ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet
- Well-quasi-ordering and Embeddability of Relational Structures
- An antichain of monomial ideals in a twisted commutative algebra
- Hereditary classes of ordered sets of width at most two
- Maximal Condorcet domains. A further progress report
- The X-class and almost-increasing permutations
- Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns
- Most principal permutation classes, and t-stack sortable permutations, have nonrational generating functions
- Minimal prime ages, words and permutation graphs
- Ordered structures with no finite monomorphic decomposition: application to the profile of hereditary classes
- Characterizing avoidance in cycles via vincular patterns
- Hertzsprung patterns on involutions
- A canonical tree decomposition for chirotopes
- A canonical tree decomposition for order types, and some applications
- Chip firing on directed k-ary trees
- The interval posets of permutations seen from the decomposition tree perspective
- Asymptotics of self-overlapping permutations
- Small configurations in simple permutations
- A decorated tree approach to random permutations in substitution-closed classes
- A general theory of Wilf-equivalence for Catalan structures
This page was built for publication: Simple permutations and pattern restricted permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2570099)
