Related papers: RC-graphs and a generalized Littlewood-Richardson …
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…
We present several generalizations of Cauchy's determinant and Schur's Pfaffian by considering matrices whose entries involve some generalized Vandermonde determinants. Special cases of our formulae include previuos formulae due to S.Okada…
The Robinson-Schensted-Knuth (RSK) correspondence is a bijective correspondence between two-rowed arrays of non-negative integers and pairs of same-shape semistandard tableaux. This correspondence satisfies the symmetry property, that is,…
We give a closed formula of the Littlewood-Richardson coefficients.
Many algorithms for inserting elements into tableaux are known, starting with the Robinson-Schensted algorithm. Much of those processes can be incorporated into the general framework of Fomin's "growth diagrams". Even for single types of…
We present a new numerical homotopy continuation algorithm for finding all solutions to Schubert problems on Grassmannians. This Littlewood-Richardson homotopy is based on Vakil's geometric proof of the Littlewood-Richardson rule. Its start…
We generalize a theorem of Littlewood concerning the factorization of Schur polynomials when their variables are twisted by roots of unity. We show that a certain family of flagged skew Schur polynomials admit a similar factorization. These…
We show that the principal specialization of the Schubert polynomial at $w$ is bounded below by $1+p_{132}(w)+p_{1432}(w)$ where $p_u(w)$ is the number of occurrences of the pattern $u$ in $w$, strengthening a previous result by A.…
We provide a generalization of the Littlewood identity, both sides of which are related to alternating sign matrices. The classical Littlewood identity establishes a nice product formula for the sum of all Schur polynomials. Compared to the…
In [Matveev-Petrov 2016](arXiv:1504.00666) a $q$-deformed Robinson-Schensted-Knuth algorithm ($q$RSK) was introduced. In this article we give reformulations of this algorithm in terms of the Noumi-Yamada description, growth diagrams and…
Macdonald polynomials are orthogonal polynomials associated to root systems, and in the type A case, the symmetric kind is a common generalization of Schur functions, Macdonald spherical functions, and Jack polynomials. We use the…
Let $\bigwedge_1$ and $\bigwedge_2$ be two symmetric function algebras in independent sets of variables. We define vector space bases of $\bigwedge_1 \otimes_\mathbb{Z} \bigwedge_2$ coming from certain quivers, with vertex sets indexed by…
A strengthened form of Schur's triangularization theorem is given for quaternion matrices with real spectrum (for complex matrices it was given by Littlewood). Littlewood's algorithm for reducing a complex matrix to a canonical form under…
The two tableaux assigned by the Robinson--Schensted correspondence are equal if and only if the input permutation is an involution, so the RS algorithm restricts to a bijection between involutions in the symmetric group and standard…
The main aim of the paper is to present a~combinatorial algorithm that, applying Littlewood-Richardson tableaux with entries equal to $1$, computes generic extensions of semisimple invariant subspaces of nilpotent linear operators.…
We extend the theory of Littlewood-Richardson fillings (defined over the non-negative integers) to include diagrams with rows and boxes of real-valued length. We realize such fillings as invariants of matrix pairs over rings with a…
The Little map and the Edelman-Greene insertion algorithm, a generalization of the Robinson-Schensted correspondence, are both used for enumerating the reduced decompositions of an element of the symmetric group. We show the Little map…
We give a survey on the Littlewood-Richardson rule. Using Gelfand-Tsetlin patterns as the main machinery of our analysis, we study the interrelationship of various combinatorial descriptions of the Littlewood-Richardson rule.
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…
The purpose of this note is to give an insertion scheme proof of the formula, $$p_\mu = \sum_{\lambda\vdash k} \chi^\lambda(\mu)s_\lambda,\formula$$ where $p_\mu$ is the power sum symmetric function, $s_\lambda$ is the Schur function and…