An algorithmic Littlewood-Richardson rule

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We introduce a Littlewood-Richardson rule based on an algorithmic deformation of skew Young diagrams and present a bijection with the classical rule. The result is a direct combinatorial interpretation and proof of the geometric rule presented by Coskun (2000). We also present a corollary regarding the Specht modules of the intermediate diagrams. © Springer Science+Business Media, LLC 2010.

Cite

CITATION STYLE

APA

Liu, R. I. (2010). An algorithmic Littlewood-Richardson rule. Journal of Algebraic Combinatorics, 31(2), 253–266. https://doi.org/10.1007/s10801-009-0184-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free