# Small Littlewood–Richardson coefficients

@article{Ikenmeyer2012SmallLC,
title={Small Littlewood–Richardson coefficients},
author={Christian Ikenmeyer},
journal={Journal of Algebraic Combinatorics},
year={2012},
volume={44},
pages={1-29}
}
• Christian Ikenmeyer
• Published 2012
• Mathematics
• Journal of Algebraic Combinatorics
• We develop structural insights into the Littlewood–Richardson graph, whose number of vertices equals the Littlewood–Richardson coefficient $$c_{\lambda ,\mu }^{\nu }$$cλ,μν for given partitions $$\lambda$$λ, $$\mu$$μ, and $$\nu$$ν. This graph was first introduced in Bürgisser and Ikenmeyer (SIAM J Discrete Math 27(4):1639–1681, 2013), where its connectedness was proved. Our insights are useful for the design of algorithms for computing the Littlewood–Richardson coefficient: We design an… CONTINUE READING

#### Citations

##### Publications citing this paper.
SHOWING 1-10 OF 19 CITATIONS

## Plethysms of symmetric functions and highest weight representations

• Mathematics
• 2018
VIEW 5 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

## Border Rank Is Not Multiplicative under the Tensor Product

• Mathematics, Physics, Computer Science
• SIAM J. Appl. Algebra Geom.
• 2019

## Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory

• Mathematics, Computer Science
• ArXiv
• 2019
VIEW 1 EXCERPT
CITES BACKGROUND

## A G ] 1 D ec 2 01 5 Fundamental invariants of orbit closures

VIEW 1 EXCERPT
CITES BACKGROUND

## From orbital measures to Littlewood-Richardson coefficients and hive polytopes

• Mathematics, Physics
• 2017

## NP-hard sets are not sparse unless P=NP: An exposition of a simple proof of Mahaney's Theorem, with applications

• Joshua Grochow
• Mathematics, Computer Science
• Electronic Colloquium on Computational Complexity
• 2016

## The Horn inequalities from a geometric point of view

• Mathematics, Physics
• 2016