相关论文: Combinatorics on several families of Kronecker coe…

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…

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…

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…

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…

In this paper, we generalize recent work of Mizuhara, Sellers, and Swisher that gives a method for establishing restricted plane partition congruences based on a bounded number of calculations. Using periodicity for partition functions, our…

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…

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 study certain bijection between plane partitions and $\mathbb{N}$-matrices. As applications, we prove a Cauchy-type identity for generalized dual Grothendieck polynomials. We introduce two statistics on plane partitions, whose generating…

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 develop the theory of copartitions, which are a generalization of partitions with connections to many classical topics in partition theory, including Rogers-Ramanujan partitions, theta functions, mock theta functions, partitions with…

The Kronecker coefficients are the structural constants for the tensor categories of representations of the symmetric groups; namely, given three partitions $\lambda, \mu, \tau$ of $n$, the multiplicity of $\lambda$ in $\mu \otimes \tau$ is…

We present new proofs and generalizations of unimodality of the q-binomial coefficients \binom{n}{k}_q as polynomials in q. We use an algebraic approach by interpreting the differences between numbers of certain partitions as Kronecker…

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.

In 2009, Corteel, Savelief and Vuleti\'c generalized the concept of overpartitions to a new object called plane overpartitions. In recent work, the author considered a restricted form of plane overpartitions called $k$-rowed plane…

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 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…

Noting a curious link between Andrews' even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is…

George Andrews and Peter Paule have recently conjectured an infinite family of congruences modulo powers of 3 for the 2-elongated plane partition function $d_2(n)$. This congruence family appears difficult to prove by classical methods. We…

In the paper, we give partition-theoretic results for the coefficients of some mock theta functions and prove their congruence properties. Some recurrence relations connecting the coefficients of the mock theta functions with certain…

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…