Related papers: Estimating and computing Kronecker Coefficients: a…
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…
We take a data-scientific approach to study whether Kronecker coefficients are zero or not. Motivated by principal component analysis and kernel methods, we define loadings of partitions and use them to describe a sufficient condition for…
In this paper we give a combinatorial interpretation for the coefficient of $s_{\nu}$ in the Kronecker product $s_{(n-p,p)}\ast s_{\lambda}$, where $\lambda=(\lambda_1, ..., \lambda_{\ell(\lambda)})\vdash n$, if $\ell(\lambda)\geq 2p-1$ or…
The Kronecker product of two Schur functions $s_{\mu}$ and $s_{\nu}$, denoted by $s_{\mu}*s_{\nu}$, is the Frobenius characteristic of the tensor product of the irreducible representations of the symmetric group corresponding to the…
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 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 two papers, B\"urgisser 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…
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…
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…
This paper gives an exposition of well known results on vector partition functions. The exposition is based on works of M. Brion, A. Szenes and M. Vergne and is geared toward explicit computer realizations. In particular, the paper presents…
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 consider the Lommel functions $s_{\mu,\nu}(z)$ for different values of the parameters $(\mu,\nu)$. We show that if $(\mu,\nu)$ are half integers, then it is possible to describe these functions with an explicit combination of polynomials…
The Littlewood-Richardson coefficients $c^\nu_{\lambda,\mu}$ are the multiplicities in the tensor product decomposition of two irreducible representations of the general linear group GL$(n, {\mathbb C})$. They are parametrized by the…
For a polynomial f: {-1, 1}^n --> C, we define the partition function as the average of e^{lambda f(x)} over all points x in {-1, 1}^n, where lambda in C is a parameter. We present a quasi-polynomial algorithm, which, given such f, lambda…
Kostka functions $K^{\pm}_{\lambda, \mu}(t)$ associated to complex reflection groups are a generalization of Kostka polynomials, which are indexed by $r$-partitions $\lambda, \mu$ and a sign $+, -$. It is known that Kostka polynomials have…
Given two Schubert classes $\sigma_{\lambda}$ and $\sigma_{\mu}$ in the quantum cohomology of a Grassmannian, we construct a partition $\nu$, depending on $\lambda$ and $\mu$, such that $\sigma_{\nu}$ appears with coefficient 1 in the…
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…
Recently Blasiak gave a combinatorial rule for the Kronecker coefficient $g_{\lambda \mu \nu}$ when $\mu$ is a hook shape by defining a set of colored Yamanouchi tableaux with cardinality $g_{\lambda\mu\nu}$ in terms of a process called…
We consider a type of divided symmetrization $\overrightarrow{D}_{\lambda,G}$ where $\lambda$ is a nonincreasing partition on $n$ and where $G$ is a graph. We discover that in the case where $\lambda$ is a hook shape partition with first…
While Kronecker coefficients $g(\lambda,\mu,\nu)$ with bounded rows are polynomial-time computable via lattice-point methods, no explicit closed-form formulas have been obtained for genuinely three-row cases in the 87 years since…