Rectangular Kronecker coefficients and plethysms in geometric complexity theory
Authors:
- Christian IkenmeyerCIChristian Ikenmeyer
- Greta PanovaGPGreta Panova
- 1 October 2017
- journal article
- Published by Elsevier in Advances in Mathematics
- Vol. 319, 40-66
Abstract
No abstract availableAll Related Versions
Funding Information
- National Science Foundation (DMS-1500834)
This publication has 29 references indexed in Scilit:
- Permanent versus determinant: Not via saturationsProceedings of the American Mathematical Society, 2016
- A decomposition rule for certain tensor product representations of the symmetric groupsJournal of Algebra, 2015
- Deciding Positivity of Littlewood--Richardson CoefficientsSIAM Journal on Discrete Mathematics, 2013
- Nonvanishing of Kronecker coefficients for rectangular shapesAdvances in Mathematics, 2011
- Even partitions in plethysmsJournal of Algebra, 2011
- An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to $\mathbf{VP}\neq\mathbf{VNP}$SIAM Journal on Computing, 2011
- Quadratic Lower Bound for Permanent Vs. Determinant in any Characteristiccomputational complexity, 2010
- On the Computation of Clebsch–Gordan Coefficients and the Dilation EffectExperimental Mathematics, 2006
- On the Durfee size of Kronecker products of characters of the symmetric group and its double coversJournal of Algebra, 2004
- Partitions into odd, enequal partsJournal of Pure and Applied Algebra, 1985