Reduced Kronecker coefficients and counter-examples to Mulmuley's strong saturation conjecture SH
From MaRDI portal
Publication:626670
DOI10.1007/s00037-009-0279-zzbMath1205.05240OpenAlexW1501988270WikidataQ123366108 ScholiaQ123366108MaRDI QIDQ626670
Emmanuel Briand, Rosa C. Orellana, Mercedes H. Rosas
Publication date: 18 February 2011
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-009-0279-z
Symmetric functions and generalizations (05E05) Representation theory for linear algebraic groups (20G05) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
Symmetric group characters as symmetric functions, Deligne categories and reduced Kronecker coefficients, Vanishing symmetric Kronecker coefficients, Combinatorics on a family of reduced Kronecker coefficients, Permanent versus determinant: Not via saturations, Necessary conditions for the positivity of Littlewood-Richardson and plethystic coefficients, Durfee squares, symmetric partitions and bounds on Kronecker coefficients, Kronecker products, characters, partitions, and the tensor square conjectures, On the asymptotics of Kronecker coefficients., On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions, Nonstandard braid relations and Chebyshev polynomials., Plethysm and lattice point counting, Obstructions to combinatorial formulas for plethysm, On the complexity of computing Kronecker coefficients, The stability of the Kronecker product of Schur functions, Unnamed Item, Proof of Stembridge's conjecture on stability of Kronecker coefficients, The Hopf structure of symmetric group characters as symmetric functions, Rectangular symmetries for coefficients of symmetric functions, Unnamed Item, Geometric Complexity Theory IV: nonstandard quantum group for the Kronecker problem, Kronecker coefficients for some near-rectangular partitions, Vector partition functions and Kronecker coefficients
