Enumerating nested and consecutive partitions

DOI10.1016/0097-3165(95)90097-7zbMath0819.05005OpenAlexW2098780983MaRDI QIDQ1805062

Frank K. Hwang, Colin L. Mallows

Publication date: 11 May 1995

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(95)90097-7

zbMATH Keywords

nested partitionsordered setnumber of partitionsconsecutive partitionsorder-consecutive partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

Related Items

The monoid of ordered partitions of a natural number ⋮ Chord diagrams, contact-topological quantum field theory and contact categories ⋮ Localizing combinatorial properties of partitions ⋮ Fibonacci colored compositions and applications ⋮ On the number of separable partitions ⋮ Sphere-separable partitions of multi-parameter elements ⋮ Succession rules and Deco polyominoes

Cites Work

• On clustering problems with connected optima in Euclidean spaces
• Optimal partitions
• Optimal Set Partitioning
• Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
• Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
• Structured Partitioning Problems
• Valency enumeration of rooted plane trees