Enumerating nested and consecutive partitions

DOI10.1016/0097-3165(95)90097-7MaRDI QIDQ1805062zbMATH OpenOpenAlexFDO

Authors 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

consecutive partitionsnested partitionsnumber of partitionsorder-consecutive partitionsordered set

Mathematics Subject Classification ID

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

Review text

The authors prove formulas for the number of partitions of an ordered set of \(n\) objects into \(p\) parts. For nested partitions \[ \text{N}(n, p)= {1\over n}\Biggl({n\atop p}\Biggr)\Biggl({n\atop p-1}\Biggr). \] For order-consecutive partitions \[ \text{OCP}(n, p)= \sum^{p-1}_{j= 0} \Biggl({n-1\atop 2p-j-2}\Biggr) \Biggl({2p-j- 2\atop j}\Biggr). \] For order-consecutive partition sequences \[ \text{OCPS}(n, p)= \sum^{p- 1}_{k= 0} (-1)^{p- 1-k} \Biggl({p-1\atop k}\Biggr) \Biggl({n+ 2k- 1\atop 2k}\Biggr). \] Properties of \(\text{N}(n, p)\) are discussed.

Recommendations

• scientific article; zbMATH DE number 1140232
• Enumerating consecutive and nested partitions for graphs
• scientific article; zbMATH DE number 6322891

Cites work

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

Cited in

(15)

• Localizing combinatorial properties of partitions
• The monoid of ordered partitions of a natural number
• Sphere-separable partitions of multi-parameter elements
• scientific article; zbMATH DE number 5870286 (Why is no real title available?)
• Fibonacci colored compositions and applications
• scientific article; zbMATH DE number 5300023 (Why is no real title available?)
• scientific article; zbMATH DE number 3941548 (Why is no real title available?)
• scientific article; zbMATH DE number 1140232 (Why is no real title available?)
• Succession rules and Deco polyominoes
• On the number of separable partitions
• Chord diagrams, contact-topological quantum field theory and contact categories
• Bijections between directed-column convex polyominoes and restricted compositions
• A construction that preserves the configuration of a matroid, with applications to lattice path matroids
• Constructible representations and Catalan numbers
• Critical valleys in binary paths

This page was built for publication: Enumerating nested and consecutive partitions

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