On abab-free and abba-free set partitions
From MaRDI portal
Recommendations
- Path partitions and \(P_{n}\)-free sets
- Partitions into sum-free sets
- A bijection between nonnegative words and sparse \(abba\)-free partitions
- Partitioning the power set of \([n]\) into \(C_k\)-free parts
- scientific article; zbMATH DE number 6739377
- Partition-free families of sets
- Partition-free families of sets
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- On singletons and adjacencies of set partitions
- Set partitions and non-crossing partitions with \(\ell\)-neighbors and \(\ell\)-isolated elements
Cited in
(50)- The Dyck pattern poset
- Extremal problems for colored trees and Davenport-Schinzel sequences
- Geometric properties of matrices induced by pattern avoidance
- Avoidance of partitions of a three-element set
- Some new characterizations of Hamiltonian cycles in triangular grid graphs
- A bijection between nonnegative words and sparse \(abba\)-free partitions
- Gray codes, loopless algorithm and partitions
- Set partitions with circular successions
- Partitions and partial matchings avoiding neighbor patterns
- Counting water cells in bargraphs of compositions and set partitions
- Rook and Wilf equivalence of integer partitions
- Pattern avoidance in ordered set partitions
- Restricted growth function patterns and statistics
- Proof of a conjecture on the infinite dimension limit of a unifying model for random matrix theory
- Counting occurrences of subword patterns in non-crossing partitions
- Block-connected set partitions
- A 2D non-overlapping code over a q-ary alphabet
- Restricted partitions and \(q\)-Pell numbers
- Set partitions avoid a four-letter pattern
- Enumeration of (k,2)-noncrossing partitions
- Pattern avoidance in ``flattened partitions
- On trees and noncrossing partitions
- Counting set partitions by the number of movable letters
- Pattern avoidance in poset permutations
- Minimal permutations with \(d\) descents
- Combinatorial aspects of Davenport-Schinzel sequences
- Reduction of \(m\)-regular noncrossing partitions
- Set partitions and parity successions
- Chung-Feller property of Schröder objects
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Combinatorial generation via permutation languages. VI: Binary trees
- Catalan numbers and pattern restricted set partitions
- Pattern avoidance in matchings and partitions
- Set partition patterns and the dimension index
- Permutations, parenthesis words, and Schröder numbers
- Dyck paths, binary words, and Grassmannian permutations avoiding an increasing pattern
- The combinatorics of a tree-like functional equation for connected chord diagrams
- Enumerating set partitions according to the number of descents of size d or more
- Partitions of a set satisfying certain set of conditions
- Visibility in non-crossing and non-nesting partitions
- Pattern avoidance and dominating compositions
- New refined enumerations of set partitions related to sorting
- Explicit enumeration formulas for \(m\)-regular simple stacks
- Ordered partitions avoiding a permutation pattern of length 3
- Some set partition statistics in non-crossing partitions and generating functions
- On the dimension of downsets of integer partitions and compositions
- Pattern avoiding partitions and Motzkin left factors
- Permutation classes and polyomino classes with excluded submatrices
- Noncrossing normal ordering for functions of boson operators
- Free rises, restricted partitions, and \(q\)-Fibonacci polynomials
This page was built for publication: On \(abab\)-free and \(abba\)-free set partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908273)
