Symmetrically constrained compositions
From MaRDI portal
Abstract: Given integers , with , a symmetrically constrained composition of into nonnegative parts is one that satisfies each of the the constraints . We show how to compute the generating function of these compositions, combining methods from partition theory, permutation statistics, and lattice-point enumeration.
Recommendations
Cites work
- A Combinatorial Property of q-Eulerian Numbers
- A Note on Partitions and Triangles With Integer Sides
- A Primal Barvinok Algorithm Based on Irrational Decompositions
- A fast algorithm for MacMahon's partition analysis
- A note on partitions and compositions defined by inequalities
- Computing the Continuous Discretely
- Effective lattice point counting in rational convex polytopes
- MacMahon's partition analysis. II: Fundamental theorems
- MacMahon's partition analysis. VII: Constrained compositions
- MacMahon's partition analysis: The Omega package
- The Seventieth William Lowell Putnam Mathematical Competition
- The joint distribution of descent and major index over restricted sets of permutations
- Triangles with Integer Sides
- q-Bernoulli and Eulerian Numbers
Cited in
(6)- Mahonian partition identities via polyhedral geometry
- A note on partitions and compositions defined by inequalities
- scientific article; zbMATH DE number 2234920 (Why is no real title available?)
- Compositions of integers with bounded parts
- Lattice point generating functions and symmetric cones
- Partitions and compositions defined by inequalities
This page was built for publication: Symmetrically constrained compositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q618862)