Pages that link to "Item:Q2570099"
From MaRDI portal
The following pages link to Simple permutations and pattern restricted permutations (Q2570099):
Displaying 50 items.
- Pairs of orthogonal countable ordinals (Q400437) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Operators of equivalent sorting power and related Wilf-equivalences (Q463051) (← links)
- Splittings and Ramsey properties of permutation classes (Q477770) (← links)
- An algorithm computing combinatorial specifications of permutation classes (Q526814) (← links)
- Enumeration of pin-permutations (Q540037) (← links)
- Substitution-closed pattern classes (Q618290) (← links)
- Grid classes and partial well order (Q645965) (← links)
- Counting \(\mathbf {(3+1)}\)-avoiding permutations (Q649006) (← links)
- The X-class and almost-increasing permutations (Q659614) (← links)
- Small configurations in simple permutations (Q709247) (← links)
- A decorated tree approach to random permutations in substitution-closed classes (Q782811) (← links)
- A general theory of Wilf-equivalence for Catalan structures (Q907236) (← links)
- On two-sided gamma-positivity for simple permutations (Q1640211) (← links)
- The Brownian limit of separable permutations (Q1660630) (← links)
- Block decomposition of permutations and Schur-positivity (Q1668673) (← links)
- Characterising inflations of monotone grid classes of permutations (Q1679336) (← links)
- Block numbers of permutations and Schur-positivity (Q1745163) (← links)
- Generating permutations with restricted containers (Q1747767) (← links)
- Countable linear orders with disjoint infinite intervals are mutually orthogonal (Q1752659) (← links)
- Restricted permutations and the wreath product (Q1861200) (← links)
- Restricted 1-3-2 permutations and generalized patterns (Q1865117) (← links)
- Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile (Q1953475) (← links)
- Permutations with restricted movement (Q2031228) (← links)
- Permutations avoiding certain partially-ordered patterns (Q2048546) (← links)
- Interval posets of permutations (Q2088077) (← links)
- The feasible regions for consecutive patterns of pattern-avoiding permutations (Q2099462) (← links)
- From Hertzsprung's problem to pattern-rewriting systems (Q2109220) (← links)
- Scaling limits of permutation classes with a finite specification: a dichotomy (Q2155196) (← links)
- Some families of trees arising in permutation analysis (Q2185210) (← links)
- Universal limits of substitution-closed permutation classes (Q2216743) (← links)
- Limit densities of patterns in permutation inflations (Q2223480) (← links)
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003) (← links)
- 2413-balloon permutations and the growth of the Möbius function (Q2288170) (← links)
- Orthogonal countable linear orders (Q2314417) (← links)
- Permutation patterns and cell decompositions (Q2319453) (← links)
- Combinatorial specifications for juxtapositions of permutation classes (Q2327217) (← links)
- Inflations of geometric grid classes of permutations (Q2339726) (← links)
- Equipopularity classes in the separable permutations (Q2341048) (← links)
- Well-quasi-order for permutation graphs omitting a path and a clique (Q2344822) (← links)
- Isomorphisms between pattern classes (Q2345763) (← links)
- Homomorphic image orders on combinatorial structures. (Q2351718) (← links)
- Decomposing inversion sets of permutations and applications to faces of the Littlewood-Richardson cone (Q2358803) (← links)
- The enumeration of permutations avoiding 3124 and 4312 (Q2363494) (← links)
- Decomposing simple permutations, with enumerative consequences (Q2377669) (← links)
- Rationality for subclasses of 321-avoiding permutations (Q2422212) (← links)
- Simple permutations and algebraic generating functions (Q2426423) (← links)
- Permutation classes of polynomial growth (Q2427006) (← links)
- Pattern classes of permutations via bijections between linearly ordered sets (Q2462323) (← links)
- Simple permutations: Decidability and unavoidable substructures (Q2474234) (← links)
