English
Related papers

Related papers: Kronecker Coefficients For Some Near-Rectangular P…

200 papers

We study the Kronecker product of two Schur functions $s_\lambda\ast s_\mu$, defined as the image of the characteristic map of the product of two $S_n$ irreducible characters. We prove special cases of a conjecture of Monical--Tokcan--Yong…

Combinatorics · Mathematics 2025-04-04 Greta Panova , Chenchen Zhao

Our main goal is to compute the decomposition of arbitrary Kronecker powers of the Harmonics of $S_n$. To do this, we give a new way of decomposing the character for the action of $S_n$ on polynomial rings with $k$ sets of $n$ variables.…

Combinatorics · Mathematics 2021-04-02 Marino Romero

Whether or not the Kronecker coefficients of the symmetric group count some set of combinatorial objects is a longstanding open question. In this work we show that a given Kronecker coefficient is proportional to the rank of a projector…

Quantum Physics · Physics 2024-05-08 Sergey Bravyi , Anirban Chowdhury , David Gosset , Vojtech Havlicek , Guanyu Zhu

The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also…

Combinatorics · Mathematics 2015-06-10 Laura Colmenarejo , Mercedes Rosas

The computation of Kronecker coefficients is a challenging problem with a variety of applications. In this paper we present an approach based on methods from symplectic geometry and residue calculus. We outline a general algorithm for the…

Representation Theory · Mathematics 2017-03-29 Velleda Baldoni , Michèle Vergne , Michael Walter

We study analogues of Kronecker coefficients for symmetric inverse semigroups, for dual symmetric inverse semigroups and for the inverse semigroups of bijections between subquotients of finite sets. In all cases we reduce the problem of…

Representation Theory · Mathematics 2025-01-29 Volodymyr Mazorchuk , Shraddha Srivastava

The Kronecker coefficients are the structure constants for the restriction of irreducible representations of the general linear group $GL(n m)$ into irreducibles for the subgroup $GL(n)\times GL(m)$. In this work we study the…

Representation Theory · Mathematics 2025-09-09 Marni Mishna , Mercedes Rosas , Sheila Sundaram

We study the remarkable Saxl conjecture which states that tensor squares of certain irreducible representations of the symmetric groups S_n contain all irreducibles as their constituents. Our main result is that they contain representations…

Combinatorics · Mathematics 2013-04-05 Igor Pak , Greta Panova , Ernesto Vallejo

We prove that for any partition $(\lambda_1,...,\lambda_{d^2})$ of size $\ell d$ there exists $k\ge 1$ such that the tensor square of the irreducible representation of the symmetric group $S_{k\ell d}$ with respect to the rectangular…

Group Theory · Mathematics 2012-06-12 Peter Bürgisser , Matthias Christandl , Christian Ikenmeyer

In this paper we apply a method of Robinson and Taulbee for computing Kronecker coefficients together with other ingredients and show that the multiplicity of each component in a Kronecker square can be obtained from an evaluation of a…

Combinatorics · Mathematics 2015-05-18 Ernesto Vallejo

We prove that in the geometric complexity theory program the vanishing of rectangular Kronecker coefficients cannot be used to prove superpolynomial determinantal complexity lower bounds for the permanent polynomial. Moreover, we prove the…

Computational Complexity · Computer Science 2017-08-14 Christian Ikenmeyer , Greta Panova

We present a way of computing Kronecker coefficients that uses a new family of rational convex polytopes, called column-row polytopes. We give several different formulas for the computation. They are alternating sums of numbers of integer…

Combinatorics · Mathematics 2026-01-05 Ernesto Vallejo , Pedro David Sánchez Salazar

It is known that the Kronecker coefficient of three partitions is a bounded and weakly increasing sequence if one increases the first part of all three partitions. Furthermore if the first parts of partitions \lambda,\mu are big enough then…

Combinatorics · Mathematics 2010-09-16 Christian Gutschwager

We present several upper and lower bounds on the Kronecker coefficients of the symmetric group. We prove $k$-stability of the Kronecker coefficients generalizing the (usual) stability, and giving a new upper bound. We prove a lower bound…

Combinatorics · Mathematics 2014-06-17 Igor Pak , Greta Panova

We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…

Combinatorics · Mathematics 2022-09-30 Florence Maas-Gariépy , Étienne Tétreault

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…

Combinatorics · Mathematics 2020-04-14 Emmanuel Briand , Rosa Orellana , Mercedes Rosas

A new simple Young diagrammatic method for Kronecker products of O(n) and Sp(2m) is proposed based on representation theory of Brauer algebras. A general procedure for the decomposition of tensor products of representations for O(n) and…

Mathematical Physics · Physics 2009-10-30 Feng Pan , Shihai Dong , J. P. Draayer

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 $\fsl_n$.

Representation Theory · Mathematics 2009-07-21 Laurent Manivel

Kronecker coefficients encode the tensor products of complex irreducible representations of symmetric groups. Their stability properties have been considered recently by several authors (Vallejo, Pak and Panova, Stembridge). We describe a…

Representation Theory · Mathematics 2014-11-14 Laurent Manivel

We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…

Combinatorics · Mathematics 2007-05-23 Ilse Fischer