Symmetrically constrained compositions
DOI10.1007/S11139-010-9232-7zbMATH Open1218.05019arXiv0906.5573OpenAlexW2000917778WikidataQ57438163 ScholiaQ57438163MaRDI QIDQ618862FDOQ618862
Matthias Beck, Ira M. Gessel, Carla D. Savage, Sunyoung Lee
Publication date: 17 January 2011
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.5573
generating functionpermutation statisticssymmetrically constrained compositionlattice-point enumerationpartition analysis
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Lattice points in specified regions (11P21)
Cites Work
- Title not available (Why is that?)
- Effective lattice point counting in rational convex polytopes
- MacMahon's partition analysis: The Omega package
- Computing the Continuous Discretely
- A Combinatorial Property of q-Eulerian Numbers
- q-Bernoulli and Eulerian Numbers
- MacMahon's partition analysis. VII: Constrained compositions
- A Primal Barvinok Algorithm Based on Irrational Decompositions
- A fast algorithm for MacMahon's partition analysis
- The Seventieth William Lowell Putnam Mathematical Competition
- The joint distribution of descent and major index over restricted sets of permutations
- A Note on Partitions and Triangles With Integer Sides
- Triangles with Integer Sides
- MacMahon's partition analysis. II: Fundamental theorems
Cited In (2)
Uses Software
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)