Recommendations
- Counting subwords in flattened partitions of sets
- Counting occurrences of subword patterns in non-crossing partitions
- Counting subword patterns in permutations arising as flattened partitions of sets
- scientific article; zbMATH DE number 2155197
- Counting subwords and regular languages
- Counting \(l\)-letter subwords in compositions
- Counting subwords in flattened permutations
- Counting subword occurrences in base-\(b\) expansions
- On the Structure of Consistent Partitions of Substring Set of a Word
- scientific article; zbMATH DE number 1919509
Cited in
(17)- ON PARTITIONS SEPARATING WORDS
- Counting occurrences for a finite set of words
- Counting subwords and regular languages
- A restricted growth word approach to partitions with odd/even size blocks
- Counting words by number of occurrences of some patterns
- Compositions of \(n\) as alternating sequences of weakly increasing and strictly decreasing partitions
- scientific article; zbMATH DE number 1919509 (Why is no real title available?)
- Counting occurrences of subword patterns in non-crossing partitions
- Avoiding type \((1,2)\) or \((2,1)\) patterns in a partition of a set
- Set partitions with circular successions
- Enumerating set partitions according to the number of descents of size \(d\) or more
- Counting corners in compositions and set partitions presented as bargraphs
- Counting set partitions by the number of movable letters
- Statistics in words and partitions of a set
- Counting subwords in flattened partitions of sets
- Words coding set partitions
- Counting peaks and valleys in a partition of a set
This page was built for publication: Counting subwords in a partition of a set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380451)
