English
Related papers

Related papers: Multiplicities, pictographs, and volumes

200 papers

Polynomial-time deterministic approximation of volumes of polytopes, up to an approximation factor that grows at most sub-exponentially with the dimension, remains an open problem. Recent work on this question has focused on identifying…

Combinatorics · Mathematics 2026-03-16 Hariharan Narayanan , Piyush Srivastava

One of spectacular results in mathematical physics is the expression of Racah matrices for symmetric representations of the quantum group $SU_q(2)$ through the Askey-Wilson polynomials, associated with the $q$-hypergeometric functions…

High Energy Physics - Theory · Physics 2018-02-13 A. Morozov

Littlewood-Richardson, Kronecker and plethysm coefficients are fundamental multiplicities of interest in Representation Theory and Algebraic Combinatorics. Determining a combinatorial interpretation for the Kronecker and plethysm…

Computational Complexity · Computer Science 2025-10-21 Greta Panova

Some representation-theoretic multiplicities, such as the Kostka and the Littlewood-Richardson coefficients, admit a combinatorial interpretation that places their computation in the complexity class #P. Whether this holds more generally is…

Quantum Physics · Physics 2026-02-10 Matthias Christandl , Aram W. Harrow , Greta Panova , Pietro M. Posta , Michael Walter

Let $r \geq 0$, and let $\lambda$ and $\mu$ be partitions such that $\lambda_1 \leq r + 1$. We present a combinatorial interpretation of the plethysm coefficient $\langle s_\lambda, s_\mu[s_r] \rangle$. As a consequence, we solve the…

Combinatorics · Mathematics 2025-08-28 Mitchell Lee

Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…

We provide a combinatorial description of the coefficients appearing in the expansion of Hall-Littlewood polynomials in terms of monomial symmetric functions. We also give a Littlewood-Richardson rule for Hall-Littlewood polynomials. For…

Combinatorics · Mathematics 2007-06-13 Christoph Schwer

Let $G$ be a finite group with symmetric generating set $S$, and let $c = \max_{R > 0} |B(2R)|/|B(R)|$ be the doubling constant of the corresponding Cayley graph, where $B(R)$ denotes an $R$-ball in the word-metric with respect to $S$. We…

Metric Geometry · Mathematics 2009-03-26 James R. Lee , Yury Makarychev

The volume and the number of lattice points of the permutohedron P_n are given by certain multivariate polynomials that have remarkable combinatorial properties. We give several different formulas for these polynomials. We also study a more…

Combinatorics · Mathematics 2007-05-23 Alexander Postnikov

We show that the Littlewood-Richardson coefficients are values at 1 of certain parabolic Kazhdan-Lusztig polynomials for affine symmetric groups. These q-analogues of Littlewood-Richardson multiplicities coincide with those previously…

Quantum Algebra · Mathematics 2007-05-23 Bernard Leclerc , Jean-Yves Thibon

If one restricts an irreducible representation $V_{\lambda}$ of $Gl_{2n}$ to the orthogonal group (respectively the symplectic group), the trivial representation appears with multiplicity one if and only if all parts of $\lambda$ are even…

Representation Theory · Mathematics 2014-07-28 Vidya Venkateswaran

Let K be a complex reductive algebraic group and V a representation of K. Let S denote the ring of polynomials on V. Assume that the action of K on S is multiplicity free. If V_{\lambda} is an irreducible representation of K, let…

Representation Theory · Mathematics 2007-05-23 William Graham , Markus Hunziker

Recently we explained that the classical $Q$ Schur functions stand behind various well-known properties of the cubic Kontsevich model, and the next step is to ask what happens in this approach to the generalized Kontsevich model (GKM) with…

High Energy Physics - Theory · Physics 2021-07-01 A. Mironov , A. Morozov

This paper contains two main results. First, we provide combinatorial branching rules for $\text{GL}_n \downarrow \text{O}_n$ and $\text{GL}_{2n} \downarrow \text{Sp}_{2n}$ extending the Littlewood restriction rules. Second, we use these…

Representation Theory · Mathematics 2025-05-15 Andrew Frohmader

We show that normalized Schur polynomials are strongly log-concave. As a consequence, we obtain Okounkov's log-concavity conjecture for Littlewood-Richardson coefficients in the special case of Kostka numbers.

Combinatorics · Mathematics 2019-09-27 June Huh , Jacob P. Matherne , Karola Mészáros , Avery St. Dizier

The Minkowski mixed volume of $n$ subpolytopes $D_1, \dots, D_n$ of a polytope $P \subset {\mathbb R}^n$ clearly does not exceed the normalized volume $n! \text{Vol}(P)$. Equality holds if and only if the subpolytopes are interlaced, i.e.,…

Combinatorics · Mathematics 2026-05-14 Fedor Selyanin

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

Newell-Littlewood coefficients $n_{\mu,\nu}^{\lambda}$ are the multiplicities occurring in the decomposition of products of universal characters of the orthogonal and symplectic groups. They may also be expressed, or even defined directly…

Combinatorics · Mathematics 2021-01-21 Ronald C King

Due to recent important work of Zyczkowski and Sommers (quant-ph/0302197 and quant-ph/0304041), exact formulas are available (both in terms of the Hilbert-Schmidt and Bures metrics) for the (n^2-1)-dimensional and (n(n-1)/2-1)-dimensional…

Quantum Physics · Physics 2013-05-29 Paul B. Slater

We present a partial generalization to Schubert calculus on flag varieties of the classical Littlewood-Richardson rule, in its version based on Schuetzenberger's jeu de taquin. More precisely, we describe certain structure constants…

Combinatorics · Mathematics 2009-01-28 Cristian Lenart