Merging-Free Partitions and Run-Sorted Permutations

zbMath1498.05004arXiv2101.07081MaRDI QIDQ5043577

Fufa Beyene, Roberto Mantaci

Publication date: 6 October 2022

Full work available at URL: https://arxiv.org/abs/2101.07081

zbMATH Keywords

algorithmcanonical formnon-crossing partitionmerging-free partitionrun-sorted permutation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05)

Related Items

Unnamed Item, Unnamed Item, Unnamed Item

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• On 1212-avoiding restricted growth functions
• Pattern avoidance in ``flattened partitions
• Combinatorial statistics on non-crossing partitions
• Noncrossing partitions
• Counting subwords in flattened partitions of sets
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Set partitions with successions and separations
• Combinatorics of Set Partitions
• Run Distribution Over Flattened Partitions
• The Number of Partitions of a Set
• Peaks are preserved under run-sorting