Mathematics – Combinatorics
Scientific paper
2009-12-22
European J. Combin. 31 (2010), pp. 1996-2005
Mathematics
Combinatorics
11 pages, final version. appears in European J. Combin
Scientific paper
10.1016/j.ejc.2010.05.008
It is known that the Kronecker coefficient of three partitions is a bounded and weakly increasing sequence if one increases the first part of all three partitions. Furthermore if the first parts of partitions \lambda,\mu are big enough then the coefficients of the Kronecker product [\lambda][\mu]=\sum_\n g(\l,\m,\n)[\nu] do not depend on the first part but only on the other parts. The reduced Kronecker product [\lambda]_\bullet \star[\mu]_\bullet can be viewed (roughly) as the Kronecker product [(n-|\lambda|,\lambda)][(n-|\mu|,\m)] for n big enough. In this paper we classify the reduced Kronecker products which are multiplicity free and those which contain less than 10 components.We furthermore give general lower bounds for the number of constituents and components of a given reduced Kronecker product. We also give a lower bound for the number of pairs of components whose corresponding partitions differ by one box. Finally we argue that equality of two reduced Kronecker products is only possible in the trivial case that the factors of the product are the same.
No associations
LandOfFree
Reduced Kronecker products which are multiplicity free or contain only few components does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Reduced Kronecker products which are multiplicity free or contain only few components, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduced Kronecker products which are multiplicity free or contain only few components will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-307269