Counting subwords in a partition of a set
zbMATH Open1193.05025MaRDI QIDQ2380451FDOQ2380451
Authors: Toufik Mansour, Mark Shattuck, Sherry H. F. Yan 
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
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
Permutations, words, matrices (05A05) Combinatorics in computer science (68R05) Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)
Cited In (17)
- Counting occurrences for a finite set of words
- Set partitions with circular successions
- Counting occurrences of subword patterns in non-crossing partitions
- Counting corners in compositions and set partitions presented as bargraphs
- Counting words by number of occurrences of some patterns
- Counting subwords and regular languages
- Compositions of \(n\) as alternating sequences of weakly increasing and strictly decreasing partitions
- Statistics in words and partitions of a set
- Words coding set partitions
- Counting set partitions by the number of movable letters
- Avoiding type \((1,2)\) or \((2,1)\) patterns in a partition of a set
- Counting peaks and valleys in a partition of a set
- ON PARTITIONS SEPARATING WORDS
- Title not available (Why is that?)
- Counting subwords in flattened partitions of sets
- Enumerating set partitions according to the number of descents of size \(d\) or more
- A restricted growth word approach to partitions with odd/even size blocks
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)
