Computation of dilated Kronecker coefficients (Q2399866)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computation of dilated Kronecker coefficients
scientific article

    Statements

    Computation of dilated Kronecker coefficients (English)
    0 references
    0 references
    0 references
    24 August 2017
    0 references
    Let \(N = n_1 n_2 \cdots n_s\), where \(n_1,\dots,n_s\) are positive integers, and write \(\mathbb C^N = \mathbb C^{n_1} \otimes \dots \otimes \mathbb C^{n_s}\). If each \(\mathbb C^{n_i}\) is endowed with the usual Hermitian inner product, then the group \(U(n_1) \times \dots \times U(n_s)\) acts unitarily on the complex vector space \(\mathbb C^N\) via the exterior tensor product. This gives a representation of \(U(n_1) \times \dots \times U(n_s)\) on Sym\((\mathbb C^N\)), the full symmetric algebra of \(\mathbb C^N\). In this paper the authors give an algorithm to compute the multiplicity of an irreducible representation of \(U(n_1) \times \dots \times U(n_s)\); these multiplicities are called the \textit{Kronecker coefficients}. More, their algorithm does not only compute individual Kronecker coefficients, but also symboic formulas that are valid on an entire polyhedral chamber. The approach is based on methods from symplectic geometry and residue calculus. As a corollary, they compute several Hilbert series related to these representations.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    representation theory
    0 references
    Kronecker coefficients
    0 references
    stretching function
    0 references
    quasi-polynomial
    0 references
    Hilbert series
    0 references
    residue calculus
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references