Related papers: Complexity and asymptotics of structure constants
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…
Some representation-theoretic multiplicities, such as the Kostka and the Littlewood-Richardson coefficients, admit a combinatorial interpretation that places their computation in the complexity class #P. Whether this holds more generally is…
Algebraic Combinatorics originated in Algebra and Representation Theory, studying their discrete objects and integral quantities via combinatorial methods which have since developed independent and self-contained lives and brought us some…
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…
An important family of structural constants in the theory of symmetric functions and in the representation theory of symmetric groups and general linear groups are the plethysm coefficients. In 1950, Foulkes observed that they have some…
We give an introduction to some of the recent ideas that go under the name "geometric complexity theory". We first sketch the proof of the known upper and lower bounds for the determinantal complexity of the permanent. We then introduce the…
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…
We propose a new approach to study plethysm coefficients by using the Schur-Weyl duality between the symmetric group and the partition algebra. This allows us to explain the stability properties of plethysm and Kronecker coefficients in a…
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…
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…
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 give explicit positive combinatorial interpretations for the plethysm coefficients $\langle s_\mu[s_\nu], s_\lambda\rangle$, when $\lambda$ has at most two rows, as counting certain marked trees. In the special case $\mu=(n)$, this also…
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 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…
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…
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…
We discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the Geometric Complexity Theory program to prove a variant of Valiant's algebraic analog of the P not equal to NP conjecture.…
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
The concept of complexity appears in virtually all areas of knowledge. Its intuitive meaning shares similarities across fields, but disagreements between its details hinders a general definition, leading to a plethora of proposed…
We explore the information geometry and asymptotic behaviour of estimators for Kronecker-structured covariances, in both growing-$n$ and growing-$p$ scenarios, with a focus towards examining the quadratic form or partial trace estimator…