[{"key":"dc.contributor.author","value":"Tewari, Vasu Vineet","language":null},{"key":"dc.date.accessioned","value":"2011-08-04T16:50:39Z","language":null},{"key":"dc.date.available","value":"2011-08-04T16:50:39Z","language":null},{"key":"dc.date.issued","value":"2011","language":null},{"key":"dc.identifier.uri","value":"http:\/\/hdl.handle.net\/2429\/36483","language":null},{"key":"dc.description.abstract","value":"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 is a combinatorial rule, namely the Littlewood-Richardson rule, which describes a way to compute the outer tensor product of two irreducible characters of the symmetric group, one would expect an algorithm which achieves the same purpose in the case of the inner tensor product. Jeffrey Remmel and Tamsen Whitehead first came up with a description of the Kronecker coefficients occurring in the Kronecker product of two Schur functions, both indexed by partitions of length at most 2. Mercedes Rosas later arrived at the same result using a different approach. The solution of the general problem would have implications in Complexity Theory and Quantum Information Theory.\n\nOur goal in this thesis is to derive formulae for computing the Kronecker product in certain cases where the Schur functions are indexed by partitions which are nearly rectangular. In particular, we study s{(n,n-1,1)}*s{(n,n)}, s{(n-1,n-1,1)}*s{(n,n-1)}, s{(n-1,n-1,2)}*s{(n,n)}, s{(n-1,n-1,1,1)}*s{(n,n)} and s{(n,n,1)}*s{(n,n,1)}. Our approach relies mainly on the fruitful interplay between manipulation of symmetric functions and the representation theory of the symmetric group. As a consequence of these formulae, we also derive an expression enumerating certain standard Young tableaux of bounded height.","language":"en"},{"key":"dc.language.iso","value":"eng","language":"en"},{"key":"dc.publisher","value":"University of British Columbia","language":"en"},{"key":"dc.rights","value":"Attribution 3.0 Unported","language":null},{"key":"dc.rights.uri","value":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/","language":null},{"key":"dc.title","value":"On the computation of Kronecker coefficients","language":"en"},{"key":"dc.type","value":"Text","language":"en"},{"key":"dc.degree.name","value":"Master of Science - MSc","language":"en"},{"key":"dc.degree.discipline","value":"Mathematics","language":"en"},{"key":"dc.degree.grantor","value":"University of British Columbia","language":"en"},{"key":"dc.date.graduation","value":"2011-11","language":"en"},{"key":"dc.type.text","value":"Thesis\/Dissertation","language":"en"},{"key":"dc.description.affiliation","value":"Science, Faculty of","language":null},{"key":"dc.description.affiliation","value":"Mathematics, Department of","language":null},{"key":"dc.degree.campus","value":"UBCV","language":"en"},{"key":"dc.description.scholarlevel","value":"Graduate","language":"en"}]