Contingency tables and the generalized Littlewood-Richardson coefficients
Mark Colarusso, William Q. Erickson, Jeb F. Willenbring

TL;DR
This paper introduces a new method for computing generalized Littlewood-Richardson coefficients using contingency tables, extending the classical combinatorial approach to multiple tensor products and other classical groups.
Contribution
It generalizes Littlewood-Richardson coefficients to r-fold tensor products and develops a contingency table-based computation method, extending to orthogonal and symplectic groups.
Findings
Method reduces to counting contingency tables in special cases
Provides a new combinatorial approach for generalized coefficients
Extends results to orthogonal and symplectic groups
Abstract
The Littlewood-Richardson coefficients give the multiplicity of an irreducible polynomial -representation in the tensor product of polynomial representations . In this paper, we generalize these coefficients to an -fold tensor product of rational representations, and give a new method for computing them using an analogue of statistical contingency tables. We demonstrate special cases in which our method reduces to counting statistical contingency tables with prescribed margins. Finally, we extend our result from the general linear group to both the orthogonal and symplectic groups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
