English
Related papers

Related papers: The problem of deciding the positivity of Kronecke…

200 papers

We study the remarkable Saxl conjecture which states that tensor squares of certain irreducible representations of the symmetric groups S_n contain all irreducibles as their constituents. Our main result is that they contain representations…

Combinatorics · Mathematics 2013-04-05 Igor Pak , Greta Panova , Ernesto Vallejo

In 2012 Jan Saxl conjectured that all irreducible representations of the symmetric group occur in the decomposition of the tensor square of the irreducible representation corresponding to the staircase partition. We make progress on this…

Representation Theory · Mathematics 2015-05-06 Christian Ikenmeyer

Motivated by the Saxl conjecture and the tensor square conjecture, which states that the tensor squares of certain irreducible representations of the symmetric group contain all irreducible representations, we study the tensor squares of…

Combinatorics · Mathematics 2023-09-06 Chenchen Zhao

Let $n$ be a positive integer, and let $\rho_n = (n, n-1, n-2, \ldots, 1)$ be the ``staircase'' partition of size $N = {n+1 \choose 2}$. The Saxl conjecture asserts that every irreducible representation $S^\lambda$ of the symmetric group…

Representation Theory · Mathematics 2022-07-11 Nate Harman , Christopher Ryba

The tensor square conjecture states that for $n \geq 10$, there is an irreducible representation $V$ of the symmetric group $S_n$ such that $V \otimes V$ contains every irreducible representation of $S_n$. Our main result is that for large…

Combinatorics · Mathematics 2020-11-10 Sammy Luo , Mark Sellke

Saxl's conjecture (2012) asserts that for the staircase partition $\rho_k = (k, k-1, \ldots, 1)$, the tensor square of the corresponding irreducible representation of the symmetric group $S_{T_k}$ contains every irreducible representation…

Representation Theory · Mathematics 2026-04-10 Soong Kyum Lee

While there has been some progress on the decomposition of Kronecker products of characters of the symmetric groups in recent times, results on the symmetric and alternating part of Kronecker squares are still scarce. Here, new results (and…

Combinatorics · Mathematics 2023-01-20 Christine Bessenrodt , Chris Bowman

Highlighting the use of critical classes, we consider constituents in Kronecker products, in particular of spin characters of the double covers of the symmetric and alternating groups. We apply results from the spin case to find…

Representation Theory · Mathematics 2017-04-04 Christine Bessenrodt

This paper consists of two prongs. Firstly, we prove that any Specht module labelled by a 2-separated partition is semisimple and we completely determine its decomposition as a direct sum of graded simple modules. Secondly, we apply these…

Representation Theory · Mathematics 2019-04-09 C. Bessenrodt , C. Bowman , L. Sutton

We know from Letellier that if for some triple of partitions the corresponding Kronecker coefficient is non-zero then the corresponding multiplicities for unipotent characters of GL(n,q) is also non-zero. A conjecture of Saxl says that the…

Representation Theory · Mathematics 2025-05-08 Emmanuel Letellier , GyeongHyeon Nam

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

We discuss implications of the following statement about the representation theory of symmetric groups: every integer appears infinitely often as an irreducible character evaluation, and every nonnegative integer appears infinitely often as…

Combinatorics · Mathematics 2018-01-30 Anshul Adve , Alexander Yong

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…

Representation Theory · Mathematics 2014-12-05 Laurent Manivel

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…

Representation Theory · Mathematics 2014-11-14 Laurent Manivel

For polynomial representations of $GL_n$ of a fixed degree, H. Krause defined a new internal tensor product using the language of strict polynomial functors. We show that over an arbitrary commutative base ring $k$, the Schur functor…

Representation Theory · Mathematics 2016-05-06 Upendra Kulkarni , Shraddha Srivastava , K V Subrahmanyam

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

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…

Group Theory · Mathematics 2012-06-12 Peter Bürgisser , Matthias Christandl , Christian Ikenmeyer

We introduce an algorithm to decompose orthogonal matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The…

Group Theory · Mathematics 2024-07-24 Sheehan Olver

We prove an explicit formula for the tensor product with itself of an irreducible complex representation of the symmetric group defined by a rectangle of height two. We also describe part of the decomposition for the tensor product of…

Representation Theory · Mathematics 2008-09-23 Laurent Manivel

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
‹ Prev 1 2 3 10 Next ›