Pages that link to "Item:Q2380451"
From MaRDI portal
The following pages link to Counting subwords in a partition of a set (Q2380451):
Displaying 12 items.
- Enumerating set partitions according to the number of descents of size \(d\) or more (Q351035) (← links)
- Set partitions with circular successions (Q404458) (← links)
- Compositions of \(n\) as alternating sequences of weakly increasing and strictly decreasing partitions (Q424093) (← links)
- Counting words by number of occurrences of some patterns (Q553997) (← links)
- Counting subwords and regular languages (Q1622966) (← links)
- Counting subwords in flattened partitions of sets (Q2352065) (← links)
- Avoiding type \((1,2)\) or \((2,1)\) patterns in a partition of a set (Q2911038) (← links)
- ON PARTITIONS SEPARATING WORDS (Q3110888) (← links)
- Counting occurrences for a finite set of words (Q3189073) (← links)
- Counting corners in compositions and set partitions presented as bargraphs (Q4576744) (← links)
- Counting set partitions by the number of movable letters (Q5220691) (← links)
- Counting occurrences of subword patterns in non-crossing partitions (Q5888416) (← links)
