Enumeration of gap-bounded set partitions

DOI10.25596/JALC-2009-237MaRDI QIDQ3589626zbMATH OpenFDO

Authors Toufik Mansour, Augustine Munagi

Publication date 20 September 2010

Full work available at URL https://doi.org/10.25596/JALC-2009-237

zbMATH Keywords

adjacency matrixdirected graphfinite automatongenerating function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Formal languages and automata (68Q45)

Recommendations

• Gap‐Free Set Partitions
• A restricted growth word approach to partitions with odd/even size blocks
• Gaps in integer partitions
• Partitions with numbers in their gaps
• Arithmetic properties of m-ary partitions without gaps

Cited in

(7)

• The depth of compositions
• Gap‐Free Set Partitions
• The gap structure of a family of integer subsets
• Two by two squares in set partitions
• scientific article; zbMATH DE number 6322891 (Why is no real title available?)
• scientific article; zbMATH DE number 5181756 (Why is no real title available?)
• Enumerating anchored permutations with bounded gaps

This page was built for publication: Enumeration of gap-bounded set partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3589626)