Pages that link to "Item:Q1908273"
From MaRDI portal
The following pages link to On \(abab\)-free and \(abba\)-free set partitions (Q1908273):
Displaying 50 items.
- Geometric properties of matrices induced by pattern avoidance (Q265055) (← links)
- Chung-Feller property of Schröder objects (Q286122) (← links)
- Pattern avoidance in poset permutations (Q304187) (← links)
- Enumerating set partitions according to the number of descents of size \(d\) or more (Q351035) (← links)
- Free rises, restricted partitions, and \(q\)-Fibonacci polynomials (Q384775) (← links)
- The Dyck pattern poset (Q394536) (← links)
- Set partitions with circular successions (Q404458) (← links)
- Pattern avoidance in ordered set partitions (Q404537) (← links)
- Partitions and partial matchings avoiding neighbor patterns (Q412240) (← links)
- Catalan numbers and pattern restricted set partitions (Q456885) (← links)
- Restricted partitions and \(q\)-Pell numbers (Q539195) (← links)
- Pattern avoiding partitions and Motzkin left factors (Q657426) (← links)
- Some new characterizations of Hamiltonian cycles in triangular grid graphs (Q908287) (← links)
- Avoidance of partitions of a three-element set (Q928779) (← links)
- Enumeration of \((k,2)\)-noncrossing partitions (Q941401) (← links)
- Block-connected set partitions (Q966144) (← links)
- Minimal permutations with \(d\) descents (Q976167) (← links)
- Gray codes, loopless algorithm and partitions (Q1040787) (← links)
- Pattern avoidance in ``flattened'' partitions (Q1043596) (← links)
- Partitions of a set satisfying certain set of conditions (Q1043979) (← links)
- Extremal problems for colored trees and Davenport-Schinzel sequences (Q1292853) (← links)
- Combinatorial aspects of Davenport-Schinzel sequences (Q1356764) (← links)
- On trees and noncrossing partitions (Q1383385) (← links)
- Permutations, parenthesis words, and Schröder numbers (Q1584395) (← links)
- Restricted growth function patterns and statistics (Q1661480) (← links)
- A 2D non-overlapping code over a \(q\)-ary alphabet (Q1704207) (← links)
- Rook and Wilf equivalence of integer partitions (Q1750226) (← links)
- Reduction of \(m\)-regular noncrossing partitions (Q1765607) (← links)
- A bijection between nonnegative words and sparse \(abba\)-free partitions (Q1874381) (← links)
- Pattern avoidance in matchings and partitions (Q1953480) (← links)
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind (Q1972357) (← links)
- Proof of a conjecture on the infinite dimension limit of a unifying model for random matrix theory (Q2000728) (← links)
- Noncrossing normal ordering for functions of boson operators (Q2269943) (← links)
- Ordered partitions avoiding a permutation pattern of length 3 (Q2441648) (← links)
- Some set partition statistics in non-crossing partitions and generating functions (Q2463900) (← links)
- Permutation classes and polyomino classes with excluded submatrices (Q2971061) (← links)
- New refined enumerations of set partitions related to sorting (Q4559339) (← links)
- Visibility in non-crossing and non-nesting partitions (Q4991851) (← links)
- Set partitions and parity successions (Q5069986) (← links)
- Counting water cells in bargraphs of compositions and set partitions (Q5155719) (← links)
- On the dimension of downsets of integer partitions and compositions (Q5197587) (← links)
- Counting set partitions by the number of movable letters (Q5220691) (← links)
- Set Partition Patterns and the Dimension Index (Q5869459) (← links)
- Counting occurrences of subword patterns in non-crossing partitions (Q5888416) (← links)
- Pattern avoidance and dominating compositions (Q6097995) (← links)
- The combinatorics of a tree-like functional equation for connected chord diagrams (Q6204690) (← links)
- Set partitions avoid a four-letter pattern (Q6589124) (← links)
- Combinatorial generation via permutation languages. VI: Binary trees (Q6612300) (← links)
- Dyck paths, binary words, and Grassmannian permutations avoiding an increasing pattern (Q6621953) (← links)
- Explicit enumeration formulas for \(m\)-regular simple stacks (Q6658051) (← links)
