English
Related papers

Related papers: Algebraic Obstructions and the Collapse of Element…

200 papers

The Kronecker coefficient g_{\lambda \mu \nu} is the multiplicity of the GL(V)\times GL(W)-irreducible V_\lambda \otimes W_\mu in the restriction of the GL(X)-irreducible X_\nu via the natural map GL(V)\times GL(W) \to GL(V \otimes W),…

Computational Complexity · Computer Science 2013-06-10 Jonah Blasiak , Ketan D. Mulmuley , Milind Sohoni

A fundamental open problem in algebraic combinatorics is to find a positive combinatorial formula for Kronecker coefficients, which are multiplicities of the decomposition of the tensor product of two \S_r-irreducibles into irreducibles.…

Representation Theory · Mathematics 2014-05-19 Jonah Blasiak

We resolve three interrelated problems on \emph{reduced Kronecker coefficients} $\overline{g}(\alpha,\beta,\gamma)$. First, we disprove the \emph{saturation property} which states that $\overline{g}(N\alpha,N\beta,N\gamma)>0$ implies…

Combinatorics · Mathematics 2020-04-07 Igor Pak , Greta Panova

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…

Combinatorics · Mathematics 2023-07-03 Greta Panova

We prove the lower bound R(M_m) \geq 3/2 m^2 - 2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the sense of the geometric complexity theory (GCT) program. While…

Computational Complexity · Computer Science 2013-03-19 Peter Bürgisser , Christian Ikenmeyer

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…

Computational Complexity · Computer Science 2017-08-02 Christian Ikenmeyer , Ketan D. Mulmuley , Michael Walter

Given an positive integer $k$, let $n:=\binom{k+1}{2}$. In 2012, during a talk at UCLA, Jan Saxl conjectured that all irreducible representations of the symmetric group $S_n$ occur in the decomposition of the tensor square of the…

Representation Theory · Mathematics 2025-11-27 Mahdi Ebrahimi

We consider real polynomial systems $f=g=0$ in two variables where $f$ has $t\geq 3$ monomial terms and $g$ has $3$ monomials terms. We prove that the number of positive isolated solutions of such a system does not exceed $3\cdot 2^{t-2} -…

Algebraic Geometry · Mathematics 2024-09-04 Boulos El Hilany

We study the complexity of computing Kronecker coefficients $g(\lambda,\mu,\nu)$. 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…

Combinatorics · Mathematics 2015-02-25 Igor Pak , Greta Panova

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…

Combinatorics · Mathematics 2022-10-24 Marni Mishna , Stefan Trandafir

For each $k\geq 3$, Green proved an arithmetic $k$-cycle removal lemma for any abelian group $G$. The best known bounds relating the parameters in the lemma for general $G$ are of tower-type. For $k>3$, even in the case $G=\mathbb{F}_2^n$…

Combinatorics · Mathematics 2018-09-05 Jacob Fox , László Miklós Lovász , Lisa Sauermann

We introduce a new approach for generating combinatorial identities and formulas by the application of Kronecker substitution to polynomial expansions within quotient rings. Our main result enables the derivation of elementary arithmetic…

General Mathematics · Mathematics 2024-11-26 Joseph M. Shunia

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…

Combinatorics · Mathematics 2015-05-18 Ernesto Vallejo

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…

Representation Theory · Mathematics 2025-09-09 Marni Mishna , Mercedes Rosas , Sheila Sundaram

It has become obvious that certain singular phenomena cannot be explained by a mere investigation of the configuration space, defined as the solution set of the loop closure equations. For example, it was observed that a particular 6R…

Robotics · Computer Science 2019-10-23 Zijia Li , Andreas Müller

It is shown that the $\mathfrak{gl}(3)$ polynomial integrable system, introduced by Sokolov-Turbiner in [arXiv:1409.7439], is equivalent to the $\mathfrak{gl}(3)$ quantum Euler-Arnold top in a constant magnetic field. Their Hamiltonian as…

Mathematical Physics · Physics 2025-03-10 Alexander V. Turbiner , Juan Carlos Lopez Vieyra , Miguel Ayala

The counting of the dimension of the space of $U(N) \times U(N) \times U(N)$ polynomial invariants of a complex $3$-index tensor as a function of degree $n$ is known in terms of a sum of squares of Kronecker coefficients. For $n \le N$, the…

High Energy Physics - Theory · Physics 2022-11-23 Joseph Ben Geloun , Sanjaye Ramgoolam

We study closed, connected, spin 4-manifolds up to stabilisation by connected sums with copies of $S^2 \times S^2$. For a fixed fundamental group, there are primary, secondary and tertiary obstructions, which together with the signature…

Geometric Topology · Mathematics 2024-06-07 Daniel Kasprowski , Mark Powell , Peter Teichner

We compute a primary cohomological obstruction to the existence of an equipartition for j mass distributions in R^d by two hyperplanes in the case 2d-3j = 1. The central new result is that such an equipartition always exists if d=6 2^k +2…

Metric Geometry · Mathematics 2014-03-03 Rade T. Zivaljevic

The framework of algebraically natural proofs was independently introduced in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017), to study the efficacy of commonly used techniques for proving lower…

Computational Complexity · Computer Science 2025-02-04 Prerona Chatterjee , Mrinal Kumar , C Ramya , Ramprasad Saptharishi , Anamay Tengse
‹ Prev 1 2 3 10 Next ›