Search arXivSearch

arXiv · math/0001084

The Kronecker product of Schur functions indexed by two-row shapes or hook shapes

Abstract

The Kronecker product of two Schur functions $s_μ$ and $s_ν$, denoted by $s_μ*s_ν$, is the Frobenius characteristic of the tensor product of the irreducible representations of the symmetric group corresponding to the partitions $μ$ and $ν$. The coefficient of $s_λ$ in this product is denoted by $γ^λ_{μν}$, and corresponds to the multiplicity of the irreducible character $χ^λ$ in $χ^μχ^ν.$ We use Sergeev's Formula for a Schur function of a difference of two alphabets and the comultiplication expansion for $s_λ[XY]$ to find closed formulas for the Kronecker coefficients $γ^λ_{μν}$ when $λ$ is an arbitrary shape and $μ$ and $ν$ are hook shapes or two-row shapes. Remmel \cite{Re1, Re2} and Remmel and Whitehead \cite{Re-Wh} derived some closed formulas for the Kronecker product of Schur functions indexed by two-row shapes or hook shapes using a different approach. We believe that the approach of this paper is more natural. The formulas obtained are simpler and reflect the symmetry of the Kronecker product.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mercedes H. Rosas. 2000-01-14. The Kronecker product of Schur functions indexed by two-row shapes or hook shapes. https://arxiv.org/abs/math/0001084

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO