External columns and chambers of vector partition functions
From MaRDI portal
Cites work
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- A polynomiality property for Littlewood-Richardson coefficients
- Algebraic unimodular counting
- All Kronecker coefficients are reduced Kronecker coefficients
- All linear symmetries of the SU(3) tensor multiplicities
- Analytic combinatorics
- Asymptotic Enumeration of Graphs with a Given Upper Bound on the Maximum Degree
- Asymptotic enumeration of sparse multigraphs with given degrees
- Computing the Continuous Discretely
- Counting with rational generating functions
- Effective lattice point counting in rational convex polytopes
- scientific article; zbMATH DE number 3163858 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 192947 (Why is no real title available?)
- Introduction to Toric Varieties. (AM-131)
- On the asymptotics of Kronecker coefficients.
- On the complexity of computing Kronecker coefficients
- On vanishing of Kronecker coefficients
- On vector partition functions
- Quasipolynomial formulas for the Kronecker coefficients indexed by two two-row shapes (extended abstract)
- Root cones and the resonance arrangement
- Singular reduction and quantization
- The complexity of computing Kronecker coefficients
- The hive model and the polynomial nature of stretched Littlewood-Richardson coefficients
- The Kronecker product of Schur functions indexed by two-row shapes or hook shapes
- The many aspects of counting lattice points in polytopes
- The number of graphs and a random graph with a given degree sequence
- Toric varieties
- Vector partition functions and Kronecker coefficients
This page was built for publication: External columns and chambers of vector partition functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6879007)
