English
Related papers

Related papers: RC-graphs and a generalized Littlewood-Richardson …

200 papers

We prove the Pieri formulas for Schur multiple zeta functions, which are generalizations of the Pieri formulas proved by Nakasuji and Takeda for hook type Schur multiple zeta functions. Moreover, we also prove the Littlewood-Richardson rule…

Number Theory · Mathematics 2024-12-19 Shutaro Nakaoka

We formulate a nonrecursive combinatorial rule for the expansion of the stable Grothendieck polynomials of [Fomin-Kirillov '94] in the basis of stable Grothendieck polynomials for partitions. This gives a common generalization, as well as…

Combinatorics · Mathematics 2010-02-17 Anders S. Buch , Andrew Kresch , Mark Shimozono , Harry Tamvakis , Alexander Yong

We show how to use Clifford algebra techniques to describe the de Rham cohomology ring of equal rank compact symmetric spaces $G/K$. In particular, for $G/K=U(n)/U(k)\times U(n-k)$, we obtain a new way of multiplying Schur polynomials,…

Representation Theory · Mathematics 2024-11-19 Kieran Calvert , Karmen Grizelj , Andrey Krutov , Pavle Pandžić

It is well-known that the intersection multiplicities of Schubert classes in the Grassmanian are Littlewood-Richardson coefficients. We generalize this statement in the context of quiver representations. Here the intersection multiplicity…

Algebraic Geometry · Mathematics 2007-05-23 Harm Derksen , Aidan Schofield , Jerzy Weyman

Edelman and Greene generalized the Robinson--Schensted--Knuth correspondence to reduced words in order to give a bijective proof of the Schur positivity of Stanley symmetric functions. Stanley symmetric functions may be regarded as the…

Combinatorics · Mathematics 2019-03-15 Sami Assaf

Littlewood-Richardson rule gives the decomposition formula for the multiplication of two Schur functions, while the decomposition formula for the multiplication of two Hall-Littlewood functions or two universal characters is also given by…

Mathematical Physics · Physics 2018-02-02 Na Wang , Ke Wu

The Littlewood-Richardson (LR) coefficient counts among many other things the LR tableaux of a given shape and a given content. We prove, that the number of LR tableaux weakly increases if one adds to the shape and the content the shape and…

Combinatorics · Mathematics 2011-03-24 Christian Gutschwager

We introduce a probabilistic generalization of the dual Robinson--Schensted--Knuth correspondence, called $qt$RSK${}^*$, depending on two parameters $q$ and $t$. This correspondence extends the $q$RS$t$ correspondence, recently introduced…

Combinatorics · Mathematics 2024-03-26 Gabriel Frieden , Florian Schreier-Aigner

We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…

Combinatorics · Mathematics 2020-09-15 Melody Chan , Nathan Pflueger

The K-theoretic Littlewood-Richardson rule, established by A. Buch, is a combinatorial method for counting the structure constants involved in the product of two Grothendieck polynomials of Grassmannian type. In this paper, we provide an…

Combinatorics · Mathematics 2025-04-04 Siddheswar Kundu

We study the explicit formula of Lusztig's integral forms of the level one quantum affine algebra $U_q(\hat{sl}_2)$ in the endomorphism ring of symmetric functions in infinitely many variables tensored with the group algebra of $\mathbb Z$.…

Quantum Algebra · Mathematics 2007-05-23 Naihuan Jing

We give a signed puzzle rule to compute Schubert coefficients. The rule is based on a careful analysis of Knutson's recurrence arXiv:math/0306304. We use the rule to prove polynomiality of the sums of Schubert coefficients with bounded…

Combinatorics · Mathematics 2025-04-25 Igor Pak , Colleen Robichaux

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

Through dualities on representations on tensor powers and symmetric powers respectively, the partition algebra and multiset partition algebra have been used to study long-standing questions in the representation theory of the symmetric…

Representation Theory · Mathematics 2023-08-15 Alexander Wilson

We introduce and study a generalization of Schur's $P$-/$Q$-functions associated to a polynomial sequence, which can be viewed as ``Macdonald's ninth variation'' for $P$-/$Q$-functions. This variation includes as special cases Schur's…

Combinatorics · Mathematics 2021-02-08 Soichi Okada

We consider the example from invariant theory concerning the conjugation action of the general linear group on several copies of the $n \times n$ matrices, and examine a symmetric function which stably describes the Hilbert series for the…

Representation Theory · Mathematics 2013-04-24 Pamela E. Harris , Jeb F. Willenbring

In previous work with Mikhail Khovanov and Aaron Lauda we introduced two odd analogues of the Schur functions: one via the combinatorics of Young tableaux (odd Kostka numbers) and one via the odd symmetrization operator. In this paper we…

Quantum Algebra · Mathematics 2011-11-17 Alexander P. Ellis

Weprovide an upper bound for generalized Littlewood-Richardson coefficients $c^w_{uv}$, where $u$ is a two-row Young diagram corresponding to a Grassmannian permutation. We end with a conjecture on the upper bounds for all such structure…

Combinatorics · Mathematics 2024-12-02 Zijie Tao , Yunchi Zheng

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

We obtain algorithms for computing Tverberg partitions based on centerpoint approximations. This applies to a wide range of convexity spaces, from the classic Euclidean setting to geodetic convexity in graphs. In the Euclidean setting, we…

Computational Geometry · Computer Science 2017-11-03 David Rolnick , Pablo Soberón