相关论文: A diagrammatic approach to Kronecker squares

What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…

We resolve two open problems on Kronecker coefficients $g(\lambda,\mu,\nu)$ of the symmetric group. First, we prove that for partitions $\lambda,\mu,\nu$ with fixed Durfee square size, the Kronecker coefficients grow at most polynomially.…

Analytic combinatorics studies the asymptotic behaviour of sequences through the analytic properties of their generating functions. This article provides effective algorithms required for the study of analytic combinatorics in several…

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…

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…

In this paper we discuss the mathematical background and the computational aspects which underly the implementation of a collection of Julia functions in the MatrixPencils package for the determination of structural properties of polynomial…

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…

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…

We settle the question of where exactly the reduced Kronecker coefficients lie on the spectrum between the Littlewood-Richardson and Kronecker coefficients by showing that every Kronecker coefficient of the symmetric group is equal to a…

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…

We study the Kronecker coefficients $g_{\lambda, \mu, \nu}$ 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…

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…

Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…

We conjecture unimodality for some sequences of generalized Kronecker coefficients and prove it for partitions with at most two columns. The proof is based on a hard Lefschetz property for corresponding highest weight spaces. We also study…

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…

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…

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…

We give formulae for computing Kronecker coefficients occurring in the expansion of $s_{\mu}*s_{\nu}$, where both $\mu$ and $\nu$ are nearly rectangular, and have smallest parts equal to either 1 or 2. In particular, we study…

This note is motivated by an old result of Kronecker on monic polynomials with integer coefficients having all their roots in the unit disc. We call such polynomials Kronecker polynomials for short. Let $k(n)$ denote the number of Kronecker…

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…