Bounding and Approximating Kostka Numbers
math.CO, cs.DS
Submitted: 2026-11-10
Updated: 2026-11-10
Terminology
Sources
- Lower bounds for contingency tables via Lorentzian polynomials
- Counting Matchings via Capacity Preserving Operators
- Logarithmic concavity of Schur and related polynomials
- The computation of Kostka Numbers and Littlewood-Richardson Coefficients is #P-complete
- Dually Lorentzian Polynomials
- Entropy, Optimization and Counting
- Maximum Entropy Distributions: Bit Complexity and Stability
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality