English
Related papers

Related papers: Deciding Positivity of Littlewood-Richardson Coeff…

200 papers

We develop structural insights into the Littlewood-Richardson graph, whose number of vertices equals the Littlewood-Richardson coefficient c({\lambda},{\mu},{\nu}) for given partitions {\lambda}, {\mu}, and {\nu}. This graph was first…

Representation Theory · Mathematics 2012-09-10 Christian Ikenmeyer

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

Given a skew diagram $\gamma/\lambda$, we determine a set of lower and upper bounds that a partition $\mu$ must satisfy for Littlewood-Richards coefficients $c^{\gamma}_{\lambda,\mu}>0$. Our algorithm depends on the characterization of…

Combinatorics · Mathematics 2023-04-07 Müge Taşkın , R. Bedii Gümüş , Sinan Işık , M. ikbal Ulvi

The Littlewood-Richardson coefficients $c^\nu_{\lambda,\mu}$ are the multiplicities in the tensor product decomposition of two irreducible representations of the general linear group GL$(n, {\mathbb C})$. They are parametrized by the…

Algebraic Geometry · Mathematics 2022-06-08 Pierre-Emmanuel Chaput , Nicolas Ressayre

Littlewood-Richardson (LR) coefficients $c_{\mu\nu}^\lambda$ may be evaluated by means of several combinatorial models, including the original LR tableaux of skew shape $\lambda/\mu$ and weight $\nu$ and the LR hives with boundary edge…

Combinatorics · Mathematics 2016-03-17 O. Azenhas , R. C. King , I. Terada

We point out that the remarkable Knutson and Tao Saturation Theorem and polynomial time algorithms for LP have together an important and immediate consequence in Geometric Complexity Theory. The problem of deciding positivity of…

Computational Complexity · Computer Science 2007-05-23 Ketan D. Mulmuley , Milind Sohoni

The stretched Littlewood-Richardson coefficient $c^{t\nu}_{t\lambda,t\mu}$ was conjectured by King, Tollu, and Toumazet to be a polynomial function in $t.$ It was shown to be true by Derksen and Weyman using semi-invariants of quivers.…

Combinatorics · Mathematics 2024-07-10 Warut Thawinrak

The Littlewood-Richardson coefficients $c^{\lambda}_{\mu\nu}$ give the multiplicity of an irreducible polynomial ${\rm GL}_n$-representation $F^{\lambda}_n$ in the tensor product of polynomial representations $F^{\mu}_n\otimes F^{\nu}_n$.…

Representation Theory · Mathematics 2020-12-15 Mark Colarusso , William Q. Erickson , Jeb F. Willenbring

The volume of the hive polytope (or polytope of honeycombs) associated with a Littlewood- Richardson coefficient of SU(n), or with a given admissible triple of highest weights, is expressed, in the generic case, in terms of the Fourier…

Representation Theory · Mathematics 2018-09-13 Robert Coquereaux , Jean-Bernard Zuber

The Newell-Littlewood numbers $N_{\mu,\nu,\lambda}$ are tensor product multiplicities of Weyl modules for classical Lie groups, in the stable limit. For which triples of partitions $(\mu,\nu,\lambda)$ does $N_{\mu,\nu,\lambda}>0$ hold? The…

Combinatorics · Mathematics 2023-02-07 Shiliang Gao , Gidon Orelowitz , Alexander Yong

We argue that Jack Littlewood-Richardson coefficients $g_{\mu\nu}^{\lambda}(\alpha)$ are specialisations of certain novel polynomials. For the triple of partitions $(\mu,\nu,\lambda)=(21,21,321)$, we prove the corresponding polynomial is…

Combinatorics · Mathematics 2026-05-12 Ryan Mickler

The classical Littlewood-Richardson coefficients C(lambda,mu,nu) carry a natural $S_3$ symmetry via permutation of the indices. Our "carton rule" for computing these numbers transparently and uniformly explains these six symmetries;…

Combinatorics · Mathematics 2010-02-18 Hugh Thomas , Alexander Yong

We give a new interpretation of the shifted Littlewood-Richardson coefficients $f_{\lambda\mu}^\nu$ ($\lambda,\mu,\nu$ are strict partitions). The coefficients $g_{\lambda\mu}$ which appear in the decomposition of Schur $Q$-function…

Representation Theory · Mathematics 2024-05-08 Khanh Nguyen Duc

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

We make progress towards understanding the structure of Littlewood-Richardson coefficients $g_{\lambda,\mu}^{\nu}$ for products of Jack symmetric functions. Building on recent results of the second author, we are able to prove new cases of…

Combinatorics · Mathematics 2023-09-29 Per Alexandersson , Ryan Mickler

We give necessary conditions for the positivity of Littlewood-Richardson coefficients and SXP coefficients. We deduce necessary conditions for the positivity of the plethystic coefficients. Explicitly, our main result states that if…

Representation Theory · Mathematics 2023-11-21 Álvaro Gutiérrez , Mercedes H. Rosas

We introduce the honeycomb model of BZ polytopes, which calculate Littlewood-Richardson coefficients, the tensor product rule for GL(n). Our main result is the existence of a particularly well-behaved honeycomb with given boundary…

Representation Theory · Mathematics 2007-05-23 Allen Knutson , Terence Tao

We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…

Representation Theory · Mathematics 2016-09-07 Jesús A. De Loera , Tyrrell B. McAllister

We find and prove a factorization formula for certain Macdonald Littlewood-Richardson coefficients $c_{\lambda\mu}^{\nu}(q,t)$. Namely, we consider the case that the Kostka number $K_{\mu, \nu -\lambda}$ is $1$. This settles a particular…

Combinatorics · Mathematics 2023-01-18 Konstantin Matveev , Yuchen Wei

J. DeLoera-T. McAllister and K. D. Mulmuley-H. Narayanan-M. Sohoni independently proved that determining the vanishing of Littlewood-Richardson coefficients has strongly polynomial time computational complexity. Viewing these as Schubert…

Combinatorics · Mathematics 2019-05-23 Anshul Adve , Colleen Robichaux , Alexander Yong
‹ Prev 1 2 3 10 Next ›