Multiplicity of compact group representations and applications to Kronecker coefficients
arXiv:1506.02472
Abstract
These notes are an expanded version of a talk given by the second author. Our main interest is focused on the challenging problem of computing Kronecker coefficients. We decided, at the beginning, to take a very general approach to the problem of studying multiplicity functions, and we survey the various aspects of the theory that comes into play, giving a detailed bibliography to orient the reader. Nonetheless the main general theorems involving multiplicities functions (convexity, quasi-polynomial behavior, Jeffrey-Kirwan residues) are stated without proofs. Then, we present in detail our approach to the computational problem, giving explicit formulae, and outlining an algorithm that calculate many interesting examples, some of which appear in the literature also in connection with Hilbert series.
References in corpus (14)
- Quantum marginal problem and representations of the symmetric group
- One-qubit reduced states of a pure many-qubit state: polygon inequalities
- Reduced Kronecker coefficients and counter-examples to Mulmuley's strong saturation conjecture SH
- Residues formulae for volumes and Ehrhart polynomials of convex polytopes
- Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry
- Proof of Stembridge's conjecture on stability of Kronecker coefficients
- A Euclid style algorithm for MacMahon's partition analysis
- Inequalities for Moment Cones of Finite-Dimensional Representations
- Vector partition function and representation theory
- Nested sets and Jeffrey Kirwan cycles
- Local Euler-Maclaurin formula for polytopes
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
- Kostant's Weight Multiplicity Formula and the Fibonacci and Lucas Numbers
- On the Computation of Clebsch-Gordan Coefficients and the Dilation Effect