On \(abab\)-free and \(abba\)-free set partitions
From MaRDI portal
Publication:1908273
DOI10.1006/eujc.1996.0005zbMath0840.05004MaRDI QIDQ1908273
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
generating function; blocks; extremal problems; set partitions; pattern; noncrossing partitions; alphabet; Davenport-Schinzel sequences; sequential form
05A15: Exact enumeration problems, generating functions
05A18: Partitions of sets
05A10: Factorials, binomial coefficients, combinatorial functions
Related Items
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, Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind, Noncrossing normal ordering for functions of boson operators, Some set partition statistics in non-crossing partitions and generating functions
