On rectangular Kronecker coefficients
نویسنده
چکیده
We show that rectangular Kronecker coefficients stabilize when the lengths of the sides of the rectangle grow, and we give an explicit formula for the limit values in terms of invariants of sln.
منابع مشابه
Kronecker Coefficients for Some Near-rectangular Partitions
We give formulae for computing Kronecker coefficients occurring in the expansion of sμ ∗ sν , where both μ and ν are nearly rectangular, and have smallest parts equal to either 1 or 2. In particular, we study s(n,n−1,1) ∗ s(n,n), s(n−1,n−1,1) ∗ s(n,n−1), s(n−1,n−1,2) ∗ s(n,n), s(n−1,n−1,1,1) ∗ s(n,n) and s(n,n,1) ∗ s(n,n,1). Our approach relies on the interplay between manipulation of symmetric...
متن کاملEstimating the Sensitivity of the Algebraic Structure of Pencils with Simple Eigenvalue Estimates
The sensitivity of the algebraic (Kronecker) structure of rectangular matrix pencils to perturbations in the coefficients is examined. Eigenvalue perturbation bounds in the spirit of Bauer–Fike are used to develop computational upper and lower bounds on the distance from a given pencil to one with a qualitatively different Kronecker structure.
متن کاملRectangular Symmetries for Coefficients of Symmetric Functions
We show that some of the main structural constants for symmetric functions (Littlewood-Richardson coefficients, Kronecker coefficients, plethysm coefficients, and the Kostka–Foulkes polynomials) share symmetries related to the operations of taking complements with respect to rectangles and adding rectangles.
متن کاملNonvanishing of Kronecker Coefficients for Rectangular Shapes
We prove that for any partition (λ1, . . . , λd2) of size dm there exists k ≥ 1 such that the tensor square of the irreducible representation of the symmetric group Skdm with respect to the rectangular partition (km, . . . , km) contains the irreducible representation corresponding to the stretched partition (kλ1, . . . , kλd2). We also prove a related approximate version of this statement in w...
متن کامل1 7 O ct 2 00 8 REDUCED KRONECKER COEFFICIENTS AND COUNTER – EXAMPLES TO MULMULEY ’ S SATURATION CONJECTURE
We provide counter–examples to Mulmuley’s SH conjecture for the Kronecker coefficients. This conjecture was proposed in the setting of Geometric Complexity Theory to show that deciding whether or not a Kronecker coefficient is zero can be done in polynomial time. We also provide a short proof of the #P–hardness of computing the Kronecker coefficients. Both results rely on the connections betwee...
متن کامل