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

DOI10.1006/eujc.1996.0005zbMath0840.05004MaRDI 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 function; blocks; extremal problems; set partitions; pattern; noncrossing partitions; alphabet; Davenport-Schinzel sequences; sequential form

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

05A18: Partitions of sets

05A10: Factorials, binomial coefficients, combinatorial functions

Related Items

Enumerating set partitions according to the number of descents of size \(d\) or more, Free rises, restricted partitions, and \(q\)-Fibonacci polynomials, The Dyck pattern poset, Set partitions with circular successions, Pattern avoidance in ordered set partitions, Partitions and partial matchings avoiding neighbor patterns, Catalan numbers and pattern restricted set partitions, Restricted partitions and \(q\)-Pell numbers, Pattern avoiding partitions and Motzkin left factors, Avoidance of partitions of a three-element set, Enumeration of \((k,2)\)-noncrossing partitions, Block-connected set partitions, Minimal permutations with \(d\) descents, Gray codes, loopless algorithm and partitions, Pattern avoidance in ``flattened partitions, Partitions of a set satisfying certain set of conditions, Extremal problems for colored trees and Davenport-Schinzel sequences, Combinatorial aspects of Davenport-Schinzel sequences, On trees and noncrossing partitions, Permutations, parenthesis words, and Schröder numbers, Reduction of \(m\)-regular noncrossing partitions, A bijection between nonnegative words and sparse \(abba\)-free partitions, Pattern avoidance in matchings and partitions, Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind, Noncrossing normal ordering for functions of boson operators, Ordered partitions avoiding a permutation pattern of length 3, Some set partition statistics in non-crossing partitions and generating functions