Set partitions with circular successions
From MaRDI portal
Publication:404458
DOI10.1016/j.ejc.2014.06.008zbMath1300.05038OpenAlexW1978450021MaRDI QIDQ404458
Toufik Mansour, Augustine O. Munagi
Publication date: 4 September 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2014.06.008
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19)
Related Items (4)
Counting permutations by simsun successions ⋮ Combinatorial identities for restricted set partitions ⋮ Counting permutations by the number of successions within cycles ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Singletons and adjacencies of set partitions of type \(B\)
- Extended set partitions with successions
- Set partitions with restrictions
- Block-connected set partitions
- On pattern-avoiding partitions
- Generating functions and generalized alternating subsets
- On \(abab\)-free and \(abba\)-free set partitions
- Successions in words and compositions
- Counting subwords in a partition of a set
- Parity successions in set partitions
- Set partitions with successions and separations
- Combinatorial proofs of some Stirling number formulas
- Combinations, Successions and the n-Kings Problem
- Combinations and Successions
- Permutations without 3-sequences
- Solution of the “Problème des ménages”
This page was built for publication: Set partitions with circular successions
