A combinatorial interpretation for the coefficients in the Kronecker product s (n?p,p) * s ? . Sém, 54A:Art. B54Af, 29 pp. (electronic), pp.7-1286, 2005. ,
Counting Complexity, Complexity theory retrospective, II, pp.81-107, 1997. ,
DOI : 10.1007/978-1-4612-1872-2_4
Shuffles of permutations and the Kronecker product, Graphs Combin, vol.1, issue.3, pp.217-263, 1985. ,
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
On the ideals of secant varieties of Segre varieties, Found. Comput. Math, vol.4, issue.4, pp.397-422, 2004. ,
Produit de kronecker des representations du groupe symetrique, Lecture Notes in Math, vol.31, pp.32-319, 1979. ,
DOI : 10.1112/jlms/s1-31.1.89
Geometric complexity theory VI: The flip via saturated and positive integer programming in representation theory and algebraic geometry, 2007. ,
Geometric complexity theory. I. An approach to the P vs. NP and related problems, SIAM J. Comput, vol.31, issue.2, pp.496-526, 2001. ,
Geometric complexity theory III: On deciding positivity of Littlewood-Richardson coefficients. cs.ArXive preprint cs, p.501076, 2005. ,
Geometric complexity theory II: Towards explicit obstructions for embeddings among class varieties. cs.ArXive preprint cs.CC/0612134, 2006. ,
On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients, Journal of Algebraic Combinatorics, vol.51, issue.2, pp.347-354, 2006. ,
DOI : 10.1007/s10801-006-0008-5
Computational complexity, 1994. ,
On the Kronecker product of Schur functions of two row shapes, Bull. Belg. Math. Soc. Simon Stevin, vol.1, issue.5, pp.649-683, 1994. ,
The Kronecker Product of Schur Functions Indexed by Two-Row Shapes or Hook Shapes, J. Algebraic Combin, vol.14, issue.2, pp.153-173, 2001. ,
DOI : 10.1007/978-3-662-04166-6_31
The symmetric group, volume 203 of Graduate Texts in Mathematics, Representations, combinatorial algorithms, and symmetric functions, 2001. ,
of Cambridge Studies in Advanced Mathematics, With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin, 1999. ,
Rank and optimal computation of generic tensors, Linear Algebra Appl, vol.5253, pp.645-685, 1983. ,
The complexity of computing the permanent, Theoret. Comput. Sci, vol.8, issue.2, pp.189-201, 1979. ,
Complexity: knots, colourings and counting Lecture Note Series, 1993. ,