Color rules for cyclic wreath products and semigroup algebras from projective toric varieties
Abstract
We introduce the notion of "color rules" for computing class functions of , where is the cyclic group of order and is the symmetric group on letters. Using a general sign-reversing involution and a map of order , we give a combinatorial proof that the irreducible decomposition of these class functions is given by a weighted sum over semistandard tableaux in the colors. Since using two colors at once is also a color rule, we are consequently able to decompose arbitrary tensor products of representations whose characters can be computed via color rules. This method extends to class functions of where is a finite abelian group. We give a number of applications, including decomposing tensor powers of the defining representation, along with a combinatorial proof of the Murnaghan-Nakayama rule for . Our main application is to the study of the linear action of on bigraded affine semigroup algebras arising from the product of projective toric varieties. In the case of the product of projective spaces, our methods give the decomposition of these bigraded characters into irreducible characters, thus deriving equivariant generalizations of Euler-Mahonian identities.
Keywords
Cite
@article{arxiv.2504.19008,
title = {Color rules for cyclic wreath products and semigroup algebras from projective toric varieties},
author = {Fabián Levicán-Santibáñez and Marino Romero},
journal= {arXiv preprint arXiv:2504.19008},
year = {2026}
}
Comments
38 pages; updated formatting, corrected typos, fixed minor mistake in Example 5.9, added Figure 7 illustrating wreath statistics for tableau