Counting subwords in a partition of a set

zbMath1193.05025MaRDI QIDQ2380451

Mark Shattuck, Sherry H. F. Yan, Toufik Mansour

Publication date: 26 March 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/225499

zbMATH Keywords

generating functionset partitionsubword pattern

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)

Related Items (7)

Counting occurrences of subword patterns in non-crossing partitions ⋮ Enumerating set partitions according to the number of descents of size \(d\) or more ⋮ Counting corners in compositions and set partitions presented as bargraphs ⋮ Set partitions with circular successions ⋮ Compositions of \(n\) as alternating sequences of weakly increasing and strictly decreasing partitions ⋮ Counting set partitions by the number of movable letters ⋮ Counting subwords in flattened partitions of sets

This page was built for publication: Counting subwords in a partition of a set