English

Constructive Method for Finding the Coefficients of a Divided Symmetrization

Combinatorics 2019-08-27 v2

Abstract

We consider a type of divided symmetrization Dλ,G\overrightarrow{D}_{\lambda,G} where λ\lambda is a nonincreasing partition on nn and where GG is a graph. We discover that in the case where λ\lambda is a hook shape partition with first part equal to 2, we may determine the expansion of Dλ,G\overrightarrow{D}_{\lambda,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.

Keywords

Cite

@article{arxiv.1908.08161,
  title  = {Constructive Method for Finding the Coefficients of a Divided Symmetrization},
  author = {Nate Ince},
  journal= {arXiv preprint arXiv:1908.08161},
  year   = {2019}
}

Comments

15 pages

R2 v1 2026-06-23T10:53:49.862Z