Pages that link to "Item:Q2352065"
From MaRDI portal
The following pages link to Counting subwords in flattened partitions of sets (Q2352065):
Displaying 14 items.
- Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method (Q277629) (← links)
- Counting subwords in flattened permutations (Q376559) (← links)
- Pattern avoidance in ``flattened'' partitions (Q1043596) (← links)
- Counting subwords and regular languages (Q1622966) (← links)
- Counting subwords in a partition of a set (Q2380451) (← links)
- The runsort permuton (Q2672956) (← links)
- Merging-Free Partitions and Run-Sorted Permutations (Q5043577) (← links)
- Run Distribution Over Flattened Partitions (Q5129995) (← links)
- The sets of flattened partitions with forbidden patterns (Q5144731) (← links)
- Counting set partitions by the number of movable letters (Q5220691) (← links)
- Counting subword patterns in permutations arising as flattened partitions of sets (Q5866251) (← links)
- Counting occurrences of subword patterns in non-crossing partitions (Q5888416) (← links)
- Peaks are preserved under run-sorting (Q6097996) (← links)
- On flattened parking functions (Q6136009) (← links)
