We prove an explicit formula for the tensor product with itself of an irreducible complex representation of the symmetric group defined by a rectangle of height two. We also describe part of the decomposition for the tensor product of representations defined by rectangles of heights two and four. Our results are deduced, through Schur-Weyl duality, from the observation that certain actions on triple tensor products of vector spaces, are multiplicity free.
We study the rate of growth experienced by the Kronecker coefficients as we add cells to the rows and columns indexing partitions. We do this by moving to the setting of the reduced 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 $\fsl_n$.
This text is an appendix to our work "On the growth of Kronecker coefficients", arXiv:1607.02887. Here, we provide some complementary theorems, remarks, and calculations that for the sake of space are not going to appear into the final version of our paper. We follow the same terminology and notation. External references to numbered equations, theorems, etc. are pointers to arXiv:1607.02887.
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 problem and then illustrate its effectiveness in several interesting examples. Significantly, our algorithm does not only compute individual Kronecker coefficients, but also symbolic formulas that are valid on an entire polyhedral chamber. As a byproduct, we are able to compute several Hilbert series.
We present a study of three families of Kronecker coefficients, which we describe in terms of reduced Kronecker coefficients. This study is grounded on the generating function of the coefficients, proved by a bijection between two combinatorial objects. This study includes the connection between plane partitions and these three families of reduced Kronecker coefficients, providing us their combinatorial interpretation. As an application, we verify that the saturation hypothesis holds for our three families of reduced Kronecker coefficients. The study also includes other interpretation in terms…
We generalize Regev's result on a virtual character of $S_n$. Suppose that $λ$ and $μ$ are integer partitions of $n$. For the associated irreducible character $χ^λ$ of $S_n$, when $χ^λ(μ)\neq0$ we find another partition $τ$ related to $λ$ such that $χ^τ(μ)\neq0$ by the virtual character. Applying this result, we obtain a class of nonzero Kronecker coefficients by Pak et al.'s character criterion. Moreover, we discuss the effectiveness of Pak et al.'s character criterion by a concrete example.
We show that the Kronecker coefficients (the Clebsch-Gordan coefficients of the symmetric group) indexed by two two-row shapes are given by quadratic quasipolynomial formulas whose domains are the maximal cells of a fan. Simple calculations provide explicitly the quasipolynomial formulas and a description of the associated fan. These new formulas are obtained from analogous formulas for the corresponding reduced Kronecker coefficients and a formula recovering the Kronecker coefficients from the reduced Kronecker coefficients. As an application, we characterize all the Kronecker coefficients in…
The Kronecker coefficients and the Littlewood-Richardson coefficients are nonnegative integers depending on three partitions. By definition, these coefficients are the multiplicities of the tensor product decomposition of two irreducible representations of symmetric groups (resp. linear groups). By a classical Littlewood-Murnaghan's result the Kronecker coefficients extend the Littlewood-Richardson ones.The nonvanishing of a Littlewood-Richardson coefficient implies linear inequalities on the triple of partitions, called Horn inequalities. In thispaper, we extend the essential Horn inequalitie…
We study the Kronecker coefficients $g_{λ, μ, ν}$ via a formula that was described by Mishna, Rosas, and Sundaram, in which the coefficients are expressed as a signed sum of vector partition function evaluations. In particular, we use this formula to determine formulas to evaluate, bound, and estimate $g_{λ, μ, ν}$ in terms of the lengths of the partitions $λ, μ$, and $ν$. We describe a computational tool to compute Kronecker coefficients $g_{λ, μ, ν}$ with $\ell(μ) \leq 2,\ \ell(ν) \leq 4,\ \ell(λ) \leq 8$. We present a set of new vanishing conditions for the Kronecker coefficients by relatin…
The Kronecker coefficients are the structural constants for the tensor categories of representations of the symmetric groups; namely, given three partitions $λ, μ, τ$ of $n$, the multiplicity of $λ$ in $μ\otimes τ$ is called the Kronecker coefficient $g^λ_{μ, τ}$. When the first part of each of the partitions is taken to be very large (the remaining parts being fixed), the values of the appropriate Kronecker coefficients stabilize; the stable value is called the reduced (or stable) Kronecker coefficient. These coefficients also generalize the Littlewood-Richardson coefficients, and have been s…
We give new bounds and asymptotic estimates for Kronecker and Littlewood--Richardson coefficients. Notably, we resolve Stanley's questions on the shape of partitions attaining the largest Kronecker and Littlewood--Richardson coefficients. We apply the results to asymptotics of the number of standard Young tableaux of skew shapes.
A fundamental problem in the representation theory of the symmetric group, Sn, is to describe the coefficients in the decomposition of a tensor product of two simple representations. These coefficients are known in the literature as the Kronecker coefficients. The Littlewood--Richardson coefficients appear as an important subfamily of the wider class of stable Kronecker coefficients. This subfamily of coefficients can be calculated using a tableaux counting algorithm known as the Littlewood--Richardson rule. This paper generalises one half of this rule (the "co-Pieri" rule) to the the wider fa…
We resolve two open problems on Kronecker coefficients $g(λ,μ,ν)$ of the symmetric group. First, we prove that for partitions $λ,μ,ν$ with fixed Durfee square size, the Kronecker coefficients grow at most polynomially. Second, we show that the maximal Kronecker coefficients $g(λ,λ,λ)$ for self-conjugate partitions $λ$ grow superexponentially. We also give applications to explicit special cases.
We prove a conjecture of Stembridge concerning stability of Kronecker coefficients that vastly generalizes Murnaghan's theorem. The main idea is to identify the sequences of Kronecker coefficients in question with Hilbert functions of modules over finitely generated algebras. The proof only uses Schur-Weyl duality and the Borel-Weil theorem and does not rely on any existing work on Kronecker coefficients.
We present three different upper bounds for Kronecker coefficients $g(λ,μ,ν)$ in terms of Kostka numbers, contingency tables and Littlewood--Richardson coefficients. We then give various examples, asymptotic applications, and compare them with existing lower bounds.
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 via the characters of $S_n$. We apply these and other results to generalize Sylvester's unimodality of the $q$-binomial coefficients $\binom{n}{k}_q$ as polynomials in $q$: we derive explicit sharp bounds on the differences of their consecutive coefficients.
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 positivity of rectangular Kronecker coefficients for a large class of partitions where the side lengths of the rectangle are at least quadratic in the length of the partition. We also compare rectangular Kronecker coefficients with their corresponding plethysm coefficients, which leads to a new lower bound for rectangular Kronecker coefficients. Moreover, we…
Deligne's category $\underline{\rm Rep}(S_t)$ is a tensor category depending on a parameter $t$ "interpolating" the categories of representations of the symmetric groups $S_n$. We construct a family of categories $\mathcal{C}_λ$ (depending on a vector of variables $λ= (λ_1, λ_2, \ldots, λ_l)$, that may be specialised to values in the ground ring) which are module categories over $\underline{\rm Rep}(S_t)$. The categories $\mathcal{C}_λ$ are defined over any ring and are constructed by interpolating permutation representations. Further, they admit specialisation functors to $S_n$-mod which are …
In this note we make explicit a stability property for Kronecker coefficients that is implicit in a theorem of Y. Dvir. Even in the simplest nontrivial case this property was overlooked despite of the work of several authors. As an application we give a new formula for some Kronecker coefficients.
We construct bases of the simple modules for partition algebras which are indexed by paths in an alcove geometry. This allows us to give a concrete interpretation (and new proof) of the monotone convergence property for Kronecker coefficients using stratifications of the cell modules of the partition algebra.
We propose a new approach to study the Kronecker coefficients by using the Schur-Weyl duality between the symmetric group and the partition algebra. We explain the limiting behavior and associated bounds in the context of the partition algebra. Our analysis leads to a uniform description of the Kronecker coefficients when one of the indexing partitions is a hook or a two-part partition.
We show that the problem of deciding positivity of Kronecker coefficients is NP-hard. Previously, this problem was conjectured to be in P, just as for the Littlewood-Richardson coefficients. Our result establishes in a formal way that Kronecker coefficients are more difficult than Littlewood-Richardson coefficients, unless P=NP. We also show that there exists a #P-formula for a particular subclass of Kronecker coefficients whose positivity is NP-hard to decide. This is an evidence that, despite the hardness of the positivity problem, there may well exist a positive combinatorial formula for th…
We present a lower bound on the Kronecker coefficients for tensor squares of the symmetric group via the characters of~$S_n$, which we apply to obtain various explicit estimates. Notably, we extend Sylvester's unimodality of $q$-binomial coefficients $\binom{n}{k}_q$ as polynomials in~$q$ to derive sharp bounds on the differences of their consecutive coefficients. We then derive effective asymptotic lower bounds for a wider class of Kronecker coefficients.
We introduce and study a multiparameter colored partition category $\mathcal{CPar}(\textbf{x})$ by extending the construction of the partition category, over an algebraically closed field $\Bbbk$ of characteristic zero and for a multiparameter $\textbf{x}\in \Bbbk^{r}$. The morphism spaces in $\mathcal{CPar}(\textbf{x})$ have bases in terms of partition diagrams whose parts are colored by elements of the multiplicative cyclic group $C_r$. We show that the endomorphism spaces of $\mathcal{CPar}(\textbf{x})$ and additive Karoubi envelope of $\mathcal{CPar}(\textbf{x})$ are generically semisimple…
In this paper we give a new sufficient condition for a general stability of Kronecker coefficients, which we call it additive stability. It was motivated by a recent talk of J. Stembridge at the conference in honor of Richard P. Stanley's 70th birthday, and it is based on work of the author on discrete tomography along the years. The main contribution of this paper is the discovery of the connection between additivity of integer matrices and stability of Kronecker coefficients. Additivity, in our context, is a concept from discrete tomography. Its advantage is that it is very easy to produce l…
We provide counter-examples to Mulmuley's strong saturation conjecture (strong SH) 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 between the Kronecker coefficients and another family of structural constants in the representation theory of the symmetric groups: Murnaghan's reduced Kronecker coefficients. An app…
We use the quantum version of Chebyshev polynomials to explicitly construct the recursive formulas for the Kronecker quantum cluster algebra with principal coefficients. As a byproduct, we obtain two bar-invariant positive $\mathbb{ZP}$-bases with one being the atomic basis.
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 geometric method, based on Schur-Weyl duality, that allows to produce huge series of instances of this phenomenon. Moreover the method gives access to lots of extra information. Most notably, we can often compute the stable Kronecker coefficients, sometimes as number of points in very explicit polytopes. We can also describe explicitely the moment polytope in…
The theory of noncommutative Schur functions can be used to obtain positive combinatorial formulae for the Schur expansion of various classes of symmetric functions, as shown by Fomin and Greene. We develop a theory of noncommutative super Schur functions and use it to prove a positive combinatorial rule for the Kronecker coefficients where one of the partitions is a hook, recovering previous results of the two authors. This method also gives a precise connection between this rule and a heuristic for Kronecker coefficients first investigated by Lascoux.
We give another proof, using tools from Geometric Invariant Theory, of a result due to S. Sam and A. Snowden in 2014, concerning the stability of Kro-necker coefficients. This result states that some sequences of Kronecker coefficients eventually stabilise, and our method gives a nice geometric bound from which the stabilisation occurs. We perform the explicit computation of such a bound on two examples, one being the classical case of Murnaghan's stability. Moreover, we see that our techniques apply to other coefficients arising in Representation Theory: namely to some plethysm coefficients a…
We study the complexity of computing Kronecker coefficients $g(λ,μ,ν)$. We give explicit bounds in terms of the number of parts $\ell$ in the partitions, their largest part size $N$ and the smallest second part $M$ of the three partitions. When $M = O(1)$, i.e. one of the partitions is hook-like, the bounds are linear in $\log N$, but depend exponentially on $\ell$. Moreover, similar bounds hold even when $M=e^{O(\ell)}$. By a separate argument, we show that the positivity of Kronecker coefficients can be decided in $O(\log N)$ time for a bounded number $\ell$ of parts and without restriction …
In the late 1930's Murnaghan discovered the existence of a stabilization phenomenon for the Kronecker product of Schur functions. For n sufficiently large, the values of the Kronecker coefficients appearing in the product of two Schur functions of degree n do not depend on the first part of the indexing partitions, but only on the values of their remaining parts. We compute the exact value of n for which all the coefficients of a Kronecker product of Schur functions stabilize. We also compute two new bounds for the stabilization of a sequence of coefficients and show that they improve existing…
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 ap…
We study polynomial SL-invariants of tensors, mainly focusing on fundamental invariants which are of smallest degrees. In particular, we prove that certain 3-dimensional analogue of the Alon--Tarsi conjecture on Latin cubes considered previously by Bürgisser and Ikenmeyer, implies positivity of (generalized) Kronecker coefficients at rectangular partitions and as a result provides values for degree sequences of fundamental invariants.
The starting point for this work is an identity that relates the number of minimal matrices with prescribed 1-marginals and coefficient sequence to a linear combination of Kronecker coefficients. In this paper we provide a bijection that realizes combinatorially this identity. As a consequence we obtain an algorithm that to each minimal matrix associates a minimal component, with respect to the dominance order, in a Kronecker product, and a combinatorial description of the corresponding Kronecker coefficient in terms of minimal matrices and tableau insertion. Our bijection follows from a gener…
A family of symmetric functions $\tilde{s}_λ$ was introduced in [OZ], and independently in [AS]. The $\tilde{s}_λ$ encode many stability properties of representations of symmetric groups (e.g. when multiplied, the structure constants are reduced Kronecker coefficients). We show that the structure constants for the Kronecker comultiplication $Δ^*$ are multiplicities for the restriction of irreducible representations from $S_{mn}$ to $S_m \times S_n$ (provided $m$ and $n$ are sufficiently large), and use the structure of $\tilde{s}_λ$ to demonstrate two-row stability properties of these restrict…
We prove that the semi-invariant ring of the standard representation space of the $l$-flagged $m$-arrow Kronecker quiver is an upper cluster algebra for any $l,m\in \mathbb{N}$. The quiver and cluster are explicitly given. We prove that the quiver with its rigid potential is a polyhedral cluster model. As a consequence, to compute each Kronecker coefficient $g_{μ,ν}^λ$ with $λ$ at most $m$ parts, we only need to count lattice points in at most $m!$ fibre (rational) polytopes inside the ${\rm g}$-vector cone, which is explicitly given.
We relate the $m$-truncated Kronecker products of symmetric functions to the semi-invariant rings of a family of quiver representations. We find cluster algebra structures for these semi-invariant rings when $m=2$. Each {\sf g}-vector cone ${\sf G}_{\Diamond_l}$ of these cluster algebras controls the $2$-truncated Kronecker products for all symmetric functions of degree no greater than $l$. As a consequence, each relevant Kronecker coefficient is the difference of the number of the lattice points inside two rational polytopes. We also give explicit description of all ${\sf G}_{\Diamond_l}$'s. …
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). In previous works we described a geometric method, based on Schur-Weyl duality, that allows to produce huge series of instances of this phenomenon. In this note we show how to go beyond these so-called additive triples. We show that the set of stable triples defines a union of faces of the moment polytope. Moreover these faces may have different dimensions, and many of the…
One way to study the Kronecker coefficients is to focus on the Kronecker cone, which is generated by the triples of partitions corresponding to non-zero Kronecker coefficients. In this article we are interested in producing particular faces of this cone, formed of stable triples (a notion defined by J. Stembridge in 2014), using many geometric notions -- principally those of dominant and well-covering pairs -- and results of N. Ressayre. This extends a result obtained independently by L. Manivel and E. Vallejo in 2014 or 2015, expressed in terms of additive matrix. To illustrate the fact that …
We give a positive combinatorial formula for the Kronecker coefficient g_{lambda mu(d) nu} for any partitions lambda, nu of n and hook shape mu(d) := (n-d,1^d). Our main tool is Haiman's \emph{mixed insertion}. This is a generalization of Schensted insertion to \emph{colored words}, words in the alphabet of barred letters \bar{1},\bar{2},... and unbarred letters 1,2,.... We define the set of \emph{colored Yamanouchi tableaux of content lambda and total color d} (CYT_{lambda, d}) to be the set of mixed insertion tableaux of colored words w with exactly d barred letters and such that w^{blft} is…
We give some elementary manifestly positive formulae for the Kronecker products s_(d,d) * s_(d+k,d-k) and s_(d,d) * s_(2d-k,1^k). These formulae demonstrate some fundamental properties of the Kronecker coefficients, and we use them to deduce a number of enumerative and combinatorial results.
In two papers, Bürgisser and Ikenmeyer (STOC 2011, STOC 2013) used an adaption of the geometric complexity theory (GCT) approach by Mulmuley and Sohoni (Siam J Comput 2001, 2008) to prove lower bounds on the border rank of the matrix multiplication tensor. A key ingredient was information about certain Kronecker coefficients. While tensors are an interesting test bed for GCT ideas, the far-away goal is the separation of algebraic complexity classes. The role of the Kronecker coefficients in that setting is taken by the so-called plethysm coefficients: These are the multiplicities in the coordi…
