Reduced kronecker coefficients and counter-examples to mulmuley's strong saturation conjecture SH: With an appendix by ketan mulmuley

Computational Complexity

Volumn 18, Issue 4, 2009, Pages 577-600

  Briand, Emmanuel ^a   Orellana, Rosa ^b   Rosas, Mercedes ^a  

^a Departamento de Álgebra   (Spain)

^b Dartmouth College   (United States)

Author keywords

Geometric complexity theory; Kronecker coefficients; Quasipolynomials; Saturation properties

Indexed keywords

EID: 84905042973     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-009-0279-z     Document Type: Article

References (39)

1. S. Arora & B. Barak (2009). Computational complexity: A modern approach. Cambridge University Press.
2. n-p,p) * sλ. Sém. Lothar. Combin. 54A, Art. B54Af, 29 pp. (electronic).
3. E. Briand, R. Orellana & M. Rosas (2009a). Quasi-polynomial formulas for the Kronecker coefficients indexed by two two-row shapes (extended abstract). In 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), DMTCS Proceedings, 241-252. Also at ArXiv:0812.0861.
4. E. Briand, R. Orellana & M. Rosas (2009b). The stability of the Kronecker products of Schur functions. ArXiv:0907.4652.
5. E. Briand, R. Orellana & M. Rosas (2009c). Quasi-polynomial formulas for the Kronecker coefficients indexed by two two-row shapes. In preparation.
6. M. Brion (1993). Stable properties of plethysm: On two conjectures of Foulkes. Manuscripta Math. 4, 347-371.
7. M. Brion & M. Vergne (1997). Residue formulae, vector partition functions and lattice points in rational polytopes. J. Amer. Math. Soc. 10(4), 797-833.
8. A. A. H. Brown, S. Van Willigenburg & M. Zabrocki (2008). Expressions for Catalan Kronecker products. ArXiv:0809.3469v1.
9. A. S. Buch (2000). The saturation conjecture (after A. Knutson and T. Tao). Enseign. Math. (2) 46(1-2), 43-60. With an appendix by William Fulton.
10. P. Bürgisser & C. Ikenmeyer (2008). The complexity of computing Kronecker coefficients. In Proceedings of FPSAC 2008 (Formal Power Series and Algebraic Combinatorics). Valparaiso.
11. J. A. De Loera & T. B. McAllister (2006). On the computation of Clebsch- Gordan coefficients and the dilation effect. Experiment. Math. 15(1), 7-19.
12. M. Dyer, R. Kannan & J. Mount (1997). Sampling contingency tables. Random Structures Algorithms 10(4), 487-506.
13. R. C. King, C. Tollu & F. Toumazet (2004). Stretched Littlewood-Richardson and Kostka coefficients. In Symmetry in physics, volume 34 of CRM Proc. Lecture Notes, 99-112. Amer. Math. Soc., Providence, RI.
14. A. Klyachko (2004). Quantum Marginal problem and representations of the symmetric group. ArXiv:quant-ph:0409113.
15. A. Knutson & T. Tao (1999). The honeycomb model of GLn(C) tensor products. I. Proof of the saturation conjecture. J. Amer. Math. Soc. 12(4), 1055-1090.
16. A. Knutson & T. Tao (2001). Honeycombs and sums of Hermitian matrices. Notices Amer. Math. Soc. 48(2), 175-186. ISSN 0002-9920.
17. H. Kraft & C. Procesi (1996). Classical invariant theory, a primer. Lecture Notes, available at http://www.math.unibas.ch/~kraft/.
18. D. E. Littlewood (1958). Products and plethysms of characters with orthogonal, symplectic and symmetric groups. Canad. J. Math. 10, 17-32.
19. I. G. Macdonald (1995). Symmetric functions and Hall polynomials. Oxford Mathematical Monographs. The Clarendon Press Oxford University Press, New York, 2nd edition. With contributions by A. Zelevinsky, Oxford Science Publications.
20. K. D. Mulmuley & M. Sohoni (2001). Geometric complexity theory. I. An approach to the P vs. NP and related problems. SIAM J. Comput. 31(2), 496-526 (electronic). (GCT1).
21. K. D. Mulmuley & M. Sohoni (2008). Geometric complexity theory. II. Towards explicit obstructions for embeddings among class varieties. SIAM J. Comput. 38(3), 1175-1206. (GCT2).
22. K. D. Mulmuley & M. Sohoni (2005). Geometric complexity theory III: On deciding positivity of Littlewood-Richardson coefficients. ArXiv:0501076. (GCT3).
23. K. D. Mulmuley & M. Sohoni (2007). Geometric complexity theory IV: Quantum group for the Kronecker Problem. ArXiv:0703110. (GCT4).
24. K. D. Mulmuley & H. Narayanan (2007). Geometric complexity theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient. ArXiv:0704.0213. (GCT5).
25. K. D. Mulmuley (2007a). Geometric complexity theory VI: The flip via saturated and positive integer programming in representation theory and algebraic geometry. Technical Report TR-2007-04, Computer Science Department, The University of Chicago. Available as arXiv:0704.0229 and at http://ramakrishnadas.cs. uchicago.edu. Revised version to be available here. (GCT6).
26. K. D. Mulmuley (2007b). On P vs NP, geometric complexity theory, and the flip I: A high-level view. Technical Report TR-2007-09, Computer Science Department, The University of Chicago. Also available as arXiv:0709.0748.
27. K. D. Mulmuley (2008b). Geometric complexity theory VII: Nonstandard quantum group for the plethysm problem. arXiv:0709.0749v1. (GCT7).
28. K. D. Mulmuley (2008c). Geometric complexity theory VIII: On canonical bases for the nonstandard quantum groups. ArXiv:0709.0751v2. (GCT8).
29. K. D. Mulmuley (2008a). Erratum to the saturation hypothesis (SH) in "Geometric Complexity Theory VI". Technical report TR2008-10, Computer Science Department, University of Chicago. http://ramakrishnadas.cs.uchicago.edu.
30. F. D. Murnaghan (1938). The Analysis of the Kronecker Product of Irreducible Representations of the Symmetric Group. Amer. J. Math. 60(3), 761-784.
31. F. D. Murnaghan (1955). On the analysis of the Kronecker product of irreducible representations of Sn. Proc. Nat. Acad. Sci. U.S.A. 41, 515-518.
32. H. Narayanan (2006). On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients. Journal of Algebraic Combinatorics 24(3), 347- 354.
33. E. Rassart (2004). A polynomiality property for Littlewood-Richardson coefficients. J. Combin. Theory Ser. A 107(2), 161-179.
34. J. B. Remmel & T. Whitehead (1994). On the Kronecker product of Schur functions of two row shapes. Bull. Belg. Math. Soc. Simon Stevin 1, 649-683.
35. M. H. Rosas (2001). The Kronecker product of Schur functions indexed by two-row shapes or hook shapes. Journal of algebraic combinatorics 14(2), 153-173. Also at arXiv:math.CO/0001084.
36. R. P. Stanley (1997). Enumerative combinatorics. Vol. 1, volume 49 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge. With a foreword by Gian-Carlo Rota, Corrected reprint of the 1986 original.
37. J.-Y. Thibon (1991). Hopf algebras of symmetric functions and tensor products of symmetric group representations. Internat. J. Algebra Comput. 1(2), 207-221.
38. L. G. Valiant (1979). The complexity of computing the permanent. Theoret. Comput. Sci. 8(2), 189-201.
39. E. Vallejo (1999). Stability of Kronecker products of irreducible characters of the symmetric group. Electronic journal of combinatorics 6(1), 1-7.