A note on partitions and compositions defined by inequalities
From MaRDI portal
Publication:3377490
Recommendations
- Partitions and compositions defined by inequalities
- Five guidelines for partition analysis with applications to lecture hall-type theorems
- Symmetrically constrained compositions
- Enumeration of integer solutions to linear inequalities defined by digraphs
- MacMahon's partition analysis. VII: Constrained compositions
Cited in
(13)- Cayley compositions, partitions, polytopes, and geometric bijections
- Enumeration of sequences constrained by the ratio of consecutive parts
- Matrix compositions
- scientific article; zbMATH DE number 3887693 (Why is no real title available?)
- Partitions and compositions defined by inequalities
- Enumeration of the degree sequences of non-separable graphs and connected graphs
- Limit shapes via bijections
- Mahonian partition identities via polyhedral geometry
- Enumeration of integer solutions to linear inequalities defined by digraphs
- Some New Families of Compositions Based on Big Part Restrictions
- Five guidelines for partition analysis with applications to lecture hall-type theorems
- The counting formulas of a class of combinatorial sets with some inequality constraints
- Symmetrically constrained compositions
This page was built for publication: A note on partitions and compositions defined by inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3377490)