English
Related papers

Related papers: Kronecker Coefficients For Some Near-Rectangular P…

200 papers

We present a study of three families of Kronecker coefficients, which we describe in terms of reduced Kronecker coefficients. This study is grounded on the generating function of the coefficients, proved by a bijection between two…

Combinatorics · Mathematics 2016-04-05 L. Colmenarejo

We study a linear map on symmetric functions that ``divides'' a partition by a positive integer $k$, sending a Schur function indexed by a partition of $kn$ to a symmetric function indexed by partitions of $n$. We determine its Schur…

Combinatorics · Mathematics 2026-05-22 Per Alexandersson , Lilan Dai

The problem of decomposing the Kronecker product of $S_n$ characters is one of the last major open problems in the ordinary representation theory of the symmetric group $S_n$. Here we prove upper and lower polynomial bounds for the…

Representation Theory · Mathematics 2010-11-09 Amitai Regev

We consider the numerical approximation of $f({\cal A})b$ where $b\in{\mathbb R}^{N}$ and $\cal A$ is the sum of Kronecker products, that is ${\cal A}=M_2 \otimes I + I \otimes M_1\in{\mathbb R}^{N\times N}$. Here $f$ is a regular function…

Numerical Analysis · Mathematics 2015-03-10 Michele Benzi , Valeria Simoncini

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…

Computational Complexity · Computer Science 2020-02-04 Nick Fischer , Christian Ikenmeyer

We present a computational approach to studying the structure of the representation ring of the symmetric group in dimension six. The Kronecker coefficients and all power formulae of irreducible representations of $S_6$ are computed using…

Representation Theory · Mathematics 2025-06-10 Jia-Cheng Sun , Chi Zhang , Haoran Zhu

One of the central open problems in both algebraic combinatorics and representation theory is to find a positive combinatorial rule for Kronecker coefficients $ g_{\lambda \, \mu \, \nu}$. A notable advance in this direction is due to…

Combinatorics · Mathematics 2026-04-28 John M. Campbell

In a recent paper, the authors introduced a new basis of the ring of symmetric functions which evaluate to the irreducible characters of the symmetric group at roots of unity. The structure coefficients for this new basis are the stable…

Combinatorics · Mathematics 2017-09-26 Rosa Orellana , Mike Zabrocki

Motivated by questions of Mulmuley and Stanley we investigate quasi-polynomials arising in formulas for plethysm. We demonstrate, on the examples of $S^3(S^k)$ and $S^k(S^3)$, that these need not be counting functions of inhomogeneous…

Representation Theory · Mathematics 2018-02-12 Thomas Kahle , Mateusz Michalek

We consider the well-known method of least squares on an equidistant grid with $N+1$ nodes on the interval $[-1,1]$ with the goal to approximate a function $f\in\mathcal{C}\left[-1,1\right]$ by a polynomial of degree $n$. We investigate the…

Numerical Analysis · Mathematics 2025-10-20 René Goertz

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

For integers $n,k,s$, we give a formula for the number $T(n,k,s)$ of order $k$ subsets of the ring $\mathbb{Z}/n\mathbb{Z}$ whose sum of elements is $s$ modulo $n$. To do so, we describe explicitly a sequence of matrices $M(k)$, for…

Number Theory · Mathematics 2025-03-21 David Broadhurst , Xavier Roulleau

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…

Combinatorics · Mathematics 2014-03-13 Igor Pak , Greta Panova

We propose a Kronecker product model for correlation or covariance matrices in the large dimensional case. The number of parameters of the model increases logarithmically with the dimension of the matrix. We propose a minimum distance (MD)…

Statistics Theory · Mathematics 2019-05-20 Christian M. Hafner , Oliver B. Linton , Haihan Tang

In the late 1930's Murnaghan discovered the existence of a stabilization phenomenon for the Kronecker product of Schur functions. For n sufficiently large, the values of the Kronecker coefficients appearing in the product of two Schur…

Representation Theory · Mathematics 2020-04-14 Emmanuel Briand , Rosa Orellana , Mercedes Rosas

We present a polynomiality property of the Littlewood-Richardson coefficients c_{\lambda\mu}^{\nu}. The coefficients are shown to be given by polynomials in \lambda, \mu and \nu on the cones of the chamber complex of a vector partition…

Combinatorics · Mathematics 2007-05-23 Etienne Rassart

We present a brief summary of the recent discovery of direct tensorial analogue of characters. We distinguish three degrees of generalization: (1) $c$-number Kronecker characters made with the help of symmetric group characters and…

High Energy Physics - Theory · Physics 2018-12-11 H. Itoyama , A. Mironov , A. Morozov

We give some elementary manifestly positive formulae for the Kronecker products s_(d,d) * s_(d+k,d-k) and s_(d,d) * s_(2d-k,1^k). These formulae demonstrate some fundamental properties of the Kronecker coefficients, and we use them to…

Combinatorics · Mathematics 2015-09-11 Andrew Brown , Stephanie van Willigenburg , Mike Zabrocki

The orthorecursive expansion of unity with respect to the system $\{x, x^2, x^3, \ldots\}$ in $L^2([0,1])$ produces a sequence of rational coefficients $(c_n)$ defined by an explicit recurrence. Kalmynin and Kosenko established the bounds…

Number Theory · Mathematics 2026-03-03 Benoit Cloitre

For any positive integer $k$ and nonnegative integer $m$, we consider the symmetric function $G\left( k,m\right)$ defined as the sum of all monomials of degree $m$ that involve only exponents smaller than $k$. We call $G\left( k,m\right)$ a…

Combinatorics · Mathematics 2023-09-26 Darij Grinberg