On the computation of Kronecker coefficients
A major open problem in algebraic combinatorics is to find a combinatorial rule to compute the Kronecker product of two Schur functions. This is the same as decomposing the inner tensor product of two irreducible characters of the symmetric group as a sum of irreducible characters. Given that there...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
University of British Columbia
2011
|
| Online Access: | http://hdl.handle.net/2429/36483 |