Constructive Method for Finding the Coefficients of a Divided Symmetrization

英文摘要：

We consider a type of divided symmetrization $\overrightarrow{D}_{λ,G}$ where $λ$ is a nonincreasing partition on $n$ and where $G$ is a graph. We discover that in the case where $λ$ is a hook shape partition with first part equal to 2, we may determine the expansion of $\overrightarrow{D}_{λ,G}$ over the basis of Schur functions. We show a combinatorial construction for finding the terms of the expansion and a second construction that allows computation of the coefficients.