On \(abab\)-free and \(abba\)-free set partitions

DOI10.1006/eujc.1996.0005zbMath0840.05004OpenAlexW2023353776MaRDI QIDQ1908273

Martin Klazar

Publication date: 27 June 1996

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1996.0005

zbMATH Keywords

generating functionblocksextremal problemsset partitionspatternnoncrossing partitionsalphabetDavenport-Schinzel sequencessequential form

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Factorials, binomial coefficients, combinatorial functions (05A10)

Related Items

Geometric properties of matrices induced by pattern avoidance ⋮ A bijection between nonnegative words and sparse \(abba\)-free partitions ⋮ Counting occurrences of subword patterns in non-crossing partitions ⋮ Chung-Feller property of Schröder objects ⋮ Pattern avoidance in poset permutations ⋮ Combinatorial aspects of Davenport-Schinzel sequences ⋮ Set partitions and parity successions ⋮ New refined enumerations of set partitions related to sorting ⋮ Enumerating set partitions according to the number of descents of size \(d\) or more ⋮ Restricted growth function patterns and statistics ⋮ Set Partition Patterns and the Dimension Index ⋮ On trees and noncrossing partitions ⋮ Free rises, restricted partitions, and \(q\)-Fibonacci polynomials ⋮ The Dyck pattern poset ⋮ Set partitions with circular successions ⋮ Pattern avoidance in ordered set partitions ⋮ Pattern avoidance and dominating compositions ⋮ Partitions and partial matchings avoiding neighbor patterns ⋮ The combinatorics of a tree-like functional equation for connected chord diagrams ⋮ Some new characterizations of Hamiltonian cycles in triangular grid graphs ⋮ A 2D non-overlapping code over a \(q\)-ary alphabet ⋮ Permutation classes and polyomino classes with excluded submatrices ⋮ Pattern avoidance in matchings and partitions ⋮ Ordered partitions avoiding a permutation pattern of length 3 ⋮ Catalan numbers and pattern restricted set partitions ⋮ Avoidance of partitions of a three-element set ⋮ Pattern avoiding partitions and Motzkin left factors ⋮ Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind ⋮ Enumeration of \((k,2)\)-noncrossing partitions ⋮ Some set partition statistics in non-crossing partitions and generating functions ⋮ Counting water cells in bargraphs of compositions and set partitions ⋮ Rook and Wilf equivalence of integer partitions ⋮ Proof of a conjecture on the infinite dimension limit of a unifying model for random matrix theory ⋮ Block-connected set partitions ⋮ Restricted partitions and \(q\)-Pell numbers ⋮ Reduction of \(m\)-regular noncrossing partitions ⋮ Minimal permutations with \(d\) descents ⋮ Noncrossing normal ordering for functions of boson operators ⋮ Counting set partitions by the number of movable letters ⋮ Visibility in non-crossing and non-nesting partitions ⋮ Gray codes, loopless algorithm and partitions ⋮ Pattern avoidance in ``flattened partitions ⋮ Extremal problems for colored trees and Davenport-Schinzel sequences ⋮ Partitions of a set satisfying certain set of conditions ⋮ Permutations, parenthesis words, and Schröder numbers ⋮ On the dimension of downsets of integer partitions and compositions