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

    Figures from this paper.

    Citations

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

    Plethysms of symmetric functions and highest weight representations

    VIEW 5 EXCERPTS
    CITES BACKGROUND & RESULTS
    HIGHLY INFLUENCED