Reduced Kronecker Coefficients and Counter–Examples to Mulmuley’s Strong Saturation Conjecture SH: With an Appendix by Ketan Mulmuley

作者: Emmanuel Briand , Rosa Orellana , Mercedes Rosas

DOI: 10.1007/S00037-009-0279-Z

关键词:

摘要: We provide counter–examples to Mulmuley’s strong saturation conjecture (strong SH) for the Kronecker coefficients. This was proposed in setting of Geometric Complexity Theory show that deciding whether or not a coefficient is zero can be done polynomial time. also short proof #P– hardness computing Both results rely on connections between coefficients and another family structural constants representation theory symmetric groups, Murnaghan’s reduced coefficients. An appendix by Mulmuley introduces relaxed form hypothesis SH, still enough aims Theory.

参考文章(32)
Christophe Tollu, Ronald C. King, Frédéric Toumazet, Stretched Littlewood-Richardson and Kostka Coefficients American Mathematical Society. pp. 99- 112 ,(2004)
Michel Brion, Michèle Vergne, Residue formulae, vector partition functions and lattice points in rational polytopes Journal of the American Mathematical Society. ,vol. 10, pp. 797- 833 ,(1997) , 10.1090/S0894-0347-97-00242-7
Sanjeev Arora, Boaz Barak, Computational Complexity: A Modern Approach Cambridge University Press. ,(2009) , 10.1017/CBO9780511804090
Ketan Mulmuley, On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view arXiv: Computational Complexity. ,(2007)
Mercedes H. Rosas, The Kronecker Product of Schur Functions Indexed by Two-Row Shapes or Hook Shapes Journal of Algebraic Combinatorics. ,vol. 14, pp. 153- 173 ,(2001) , 10.1023/A:1011942029902
Ernesto Vallejo, Stability of Kronecker Products of Irreducible Characters of the Symmetric Group Electronic Journal of Combinatorics. ,vol. 6, pp. 39- ,(1999) , 10.37236/1471
Alexander Klyachko, QUANTUM MARGINAL PROBLEM AND REPRESENTATIONS OF THE SYMMETRIC GROUP arXiv: Quantum Physics. ,(2004)
Ketan D. Mulmuley, Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups arXiv: Computational Complexity. ,(2007)
Allen Knutson, Terence Tao, The honeycomb model of _{}(ℂ) tensor products I: Proof of the saturation conjecture Journal of the American Mathematical Society. ,vol. 12, pp. 1055- 1090 ,(1999) , 10.1090/S0894-0347-99-00299-4