English
Related papers

Related papers: Bounds on Kronecker and $q$-binomial coefficients

200 papers

We present an asymmetric $q$-Painlev\'e equation. We will derive this using $q$-orthogonal polynomials with respect to generalized Freud weights: their recurrence coefficients will obey this $q$-Painlev\'e equation (up to a simple…

Classical Analysis and ODEs · Mathematics 2008-08-08 Lies Boelen , Christophe Smet , Walter Van Assche

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 obtain new uniform upper bounds for the (non necessarily symmetric) tensor rank of the multiplication in the extensions of the finite fields $\F_q$ for any prime or prime power $q\geq2$; moreover these uniform bounds lead to new…

Algebraic Geometry · Mathematics 2015-12-31 Julia Pieltant , Hugues Randriam

We introduce an expansion formula for elements in quantum cluster algebras associated to type A and Kronecker quivers with principal quantization. Our formula is parametrized by perfect matchings of snake graphs as in the classical case. In…

Quantum Algebra · Mathematics 2018-09-20 Ilke Canakci , Philipp Lampe

The $q$-binomial coefficients are q-analogues of the binomial coefficients, counting the number of $k$-dimensional subspaces in the $n$-dimensional vector space $\mathbb{F}^n_q$ over $\mathbb{F}_{q}$. In this paper, we define a Euclidean…

Combinatorics · Mathematics 2023-08-31 Semin Yoo

For a root system R, a field K and a "choice of coefficients in K" we define a category of graded spaces with operators and study some of its properties. Then we assume that the coefficients are given by quantum binomials. We use basic…

Representation Theory · Mathematics 2023-11-16 Peter Fiebig

The polynomial coefficient $\binom {n,q}{k}$ is defined to be the coefficient of $x^{k}$ in the expansion of $(1+x+x^2+... +x^{q-1})^n$. In this note we give an asymptotic estimate for $\binom {n,q}{cn}$ as $n$ tends to infinity, where $c$…

Combinatorics · Mathematics 2014-12-04 Jiyou Li

In this note we make explicit a stability property for Kronecker coefficients that is implicit in a theorem of Y. Dvir. Even in the simplest nontrivial case this property was overlooked despite of the work of several authors. As an…

Combinatorics · Mathematics 2015-05-18 Ernesto Vallejo

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…

Symbolic Computation · Computer Science 2016-05-03 Stephen Melczer , Bruno Salvy

$q$-Analogues of the coefficients of $x^a$ in the expansion of $\prod_{j=1}^N (1+x+...+x^j)^{L_j}$ are proposed. Useful properties, such as recursion relations, symmetries and limiting theorems of the ``$q$-supernomial coefficients'' are…

q-alg · Mathematics 2008-02-03 Anne Schilling , S. Ole Warnaar

We present a new bound on $A = \max_n |a_{pqr}(n)|$, where $a_{pqr}(n)$ are the coefficients of a ternary cyclotomic polynomial. We also prove that two consecutive coefficients of such a polynomial differ by at most one.

Number Theory · Mathematics 2015-05-13 Bartlomiej Bzdega

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 provide counter-examples to Mulmuley's strong saturation conjecture (strong SH) for the Kronecker coefficients. This conjecture was proposed in the setting of Geometric Complexity Theory to show that deciding whether or not a Kronecker…

Combinatorics · Mathematics 2022-05-16 Emmanuel Briand , Rosa Orellana , Mercedes Rosas

In this article, we realize the subquotient based modules of certain tensor products or restricted modules via Lusztig's perverse sheaves on multi-framed quivers, and provide a construction of their canonical bases. As an application, we…

Representation Theory · Mathematics 2025-04-22 Yixin Lan

In 2013, Pak and Panova proved the strict unimodality property of $q$-binomial coefficients $\binom{\ell+m}{m}_q$ (as polynomials in $q$) based on the combinatorics of Young tableaux and the semigroup property of Kronecker coefficients.…

Symbolic Computation · Computer Science 2023-09-04 Christoph Koutschan , Ali K. Uncu , Elaine Wong

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

Computational Complexity · Computer Science 2007-05-23 Peter Buergisser , Martin Lotz

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 introduce certain quiver analogue of the determinantal variety. We study the Kempf-Lascoux-Weyman's complex associated to a line bundle on the variety. In the case of generalized Kronecker quivers, we give a sufficient condition on when…

Commutative Algebra · Mathematics 2015-04-10 Jiarui Fei

We study multiplicities of unipotent characters in tensor products of unipotent characters of GL(n,q). We prove that these multiplicities are polynomials in q with non-negative integer coefficients. We study the degree of these polynomials…

Representation Theory · Mathematics 2012-04-13 Emmanuel Letellier

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…

Combinatorics · Mathematics 2026-01-05 Ernesto Vallejo , Pedro David Sánchez Salazar