English
Related papers

Related papers: Kronecker multiplicities in the $(k,\ell)$ hook ar…

200 papers

We generalize two results about subgroups of multiplicative group of finite field of prime order. In particular, the lower bound on the cardinality of the set of values of polynomial $P(x,y)$ is obtained under the certain conditions, if…

Combinatorics · Mathematics 2020-08-21 Sofia Aleshina , Ilya Vyugin

Consider the Grothendieck group of finite type projective modular representations of the symmetric groups on n letters, or more generally, of its wreath product with a finite group. They form a graded group, with a product defined using…

Representation Theory · Mathematics 2017-10-13 Hélène Pérennou

The Sequential Multiple Knapsack Problem is a special case of Multiple knapsack problem in which the items sizes are divisible. A characterization of the optimal solutions of the problem and a description of the convex hull of all the…

Optimization and Control · Mathematics 2014-06-13 Paolo Detti

Some conjectures on partition hook lengths, recently stated by the author, have been proved and generalized by Stanley, who also needed a formula by Andrews, Goulden and Jackson on symmetric functions to complete his derivation. Another…

Combinatorics · Mathematics 2008-07-14 Guo-Niu Han

In \cite{[CZ]}, Cohen and Zemel showed that for a partition $\lambda \vdash k$, the dimension of the irreducible representation of $S_{n}$ corresponding to the partition $(n-k,\lambda) \vdash n$ is a polynomial of degree $k$ in $n$, whose…

Combinatorics · Mathematics 2026-01-26 Tom Moshaiov , Shaul Zemel

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 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…

Computational Complexity · Computer Science 2017-08-14 Christian Ikenmeyer , Greta Panova

Translated into the language of representations of quivers, a challenge in matrix pencil theory is to find sufficient and necessary conditions for a Kronecker representation to be a subfactor of another Kronecker representation in terms of…

Representation Theory · Mathematics 2007-05-23 Yang Han

For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.

Probability · Mathematics 2007-05-23 Alexander Gnedin

Let k be an algebraically closed field of characteristic p>0. We compute the Weyl filtration multiplicities in indecomposable tilting modules and the decomposition numbers for the general linear group over k in terms of cap diagrams under…

Representation Theory · Mathematics 2023-01-09 Rudolf Tange

We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…

Algebraic Geometry · Mathematics 2016-12-16 Pinaki Mondal

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

Given a commutative unital ring $R$, we show that the finiteness length of a group $G$ is bounded above by the finiteness length of the Borel subgroup of rank one $\mathbf{B}_2^\circ(R)=\left( \begin{smallmatrix} * & * \\ 0 & *…

Group Theory · Mathematics 2023-12-20 Yuri Santos Rego

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

Number Theory · Mathematics 2024-09-05 Philipp Habegger , Alina Ostafe , Igor E. Shparlinski

We prove that the permutations of $\{1,\dots, n\}$ having an increasing (resp., decreasing) subsequence of length $n-r$ index a subset of the set of all $r$th Kronecker powers of $n \times n$ permutation matrices which is a basis for the…

Combinatorics · Mathematics 2022-11-09 Stephen R. Doty

Clonoids are sets of finitary operations between two algebraic structures that are closed under composition with their term operations on both sides. We conjecture that, for finite modules $\mathbf A$ and $\mathbf B$ there are only finitely…

Rings and Algebras · Mathematics 2026-02-05 Stefano Fioravanti , Michael Kompatscher , Bernardo Rossi

We relate the $m$-truncated Kronecker products of symmetric functions to the semi-invariant rings of a family of quiver representations. We find cluster algebra structures for these semi-invariant rings when $m=2$. Each {\sf g}-vector cone…

Representation Theory · Mathematics 2015-08-26 Jiarui Fei

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

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

We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let $\mu$ be a function on the subsets of vertices of a graph $G$. In the $(\mu,p,q)$-PARTITION problem, the task is to…

Data Structures and Algorithms · Computer Science 2017-11-13 Daniel Lokshtanov , Dániel Marx