A max-flow algorithm for positivity of Littlewood-Richardson coefficients, pp.357-368, 2009. ,
Non-log-concave Littlewood-Richardson coefficients, Compos. Math, vol.43, pp.1545-1557, 2007. ,
A polynomiality property for Littlewood???Richardson coefficients, Journal of Combinatorial Theory, Series A, vol.107, issue.2, pp.161-179, 2004. ,
DOI : 10.1016/j.jcta.2004.04.003
Lattice Point Enumeration Software ,
Probability Inequalities for Sums of Bounded Random Variables, Journal of the American Statistical Association, vol.1, issue.301, pp.13-30 ,
DOI : 10.1214/aoms/1177730491
Random walks on polytopes and an affine interior point algorithm for linear programming, Mathematics of Operations Research, 2012. ,
Sampling lattice points, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, 1997. ,
DOI : 10.1145/258533.258665
¨ Uber die zusammenziehende und Lipschitzsche Transformationen, 1934. ,
The honeycomb model of GL n (C) tensor products I: proof of the saturation conjecture, Journal of the American Mathematical Society, vol.12, issue.04, pp.1055-1090, 1999. ,
DOI : 10.1090/S0894-0347-99-00299-4
The honeycomb model of GL n (C) tensor products II. Puzzles determine facets of the Littlewood-Richardson cone, J. Amer. Math. Soc, vol.17, issue.1, 1948. ,
On the computation of Clebsch-Gordan coefficients and the dilation effect, Experiment. Math, vol.15, issue.1, pp.7-20, 2006. ,
Simulated annealing in convex bodies and an O*(n/sup 4/) volume algorithm, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., 2003. ,
DOI : 10.1109/SFCS.2003.1238237
and Related Problems, SIAM Journal on Computing, vol.31, issue.2, pp.496-526, 2001. ,
DOI : 10.1137/S009753970038715X
Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties, SIAM Journal on Computing, vol.38, issue.3, 2008. ,
DOI : 10.1137/080718115
Geometric complexity theory III: on deciding nonvanishing of a Littlewood???Richardson coefficient, Journal of Algebraic Combinatorics, vol.38, issue.2, pp.103-110, 2012. ,
DOI : 10.1007/s10801-011-0325-1
On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients, Journal of Algebraic Combinatorics, vol.51, issue.2, 2006. ,
DOI : 10.1007/s10801-006-0008-5
Estimating Certain Non-zero Littlewood-Richardson Coefficients " , arxiv preprint ,
Puzzles, tableaux, and mosaics, Journal of Algebraic Combinatorics, vol.69, issue.1, pp.461-480, 2008. ,
DOI : 10.1007/s10801-007-0110-3
Convex bodies: the Brunn-Minkowski Theory, 1993. ,
DOI : 10.1017/CBO9780511526282
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs, Operations Research, vol.34, issue.2, pp.250-256, 1986. ,
DOI : 10.1287/opre.34.2.250
Why would multiplicities be log-concave? The Orbit Method in Geometry and Physics, Progress in Mathematics, vol.213, pp.329-347, 2003. ,
Group Theory and Its Application to the Quantum Mechanics of Atomic Spectra, expanded and improved, 1959. ,