On immanants of Cayley tables
Combinatorics
2026-05-07 v1
Abstract
Let G be a finite abelian group of order n and let MG=(xa+b)a,b∈G be the Cayley table of G. Let immλ(MG) be the immanant of MG with respect to a partition λ and Iλ(G) be the number of formally different monomials occurring in immλ(MG) (in particular, we denote by P(G) (resp. D(G)) for the corresponding quantity for per(MG) (resp. det(MG)) for simplicity). The study of P(G) and D(G) lies at the intersection of algebraic combinatorics and additive combinatorics. In this paper, we prove the following results. (1) If ∣G∣ is a prime power, then P(G)=D(G). (2) If ∣G∣ is odd, then I(n−1,1)(G)=I(2,1n−2)(G)=0, and if ∣G∣≡2(mod4), then I(n−1,1)(G)=P(G)andI(2,1n−2)(G)=D(G). (3) If ∣G∣ is odd and ∣G∣≥7, then imm(4,1n−4)(MG)=imm(2,2,2,1n−6)(MG).
Cite
@article{arxiv.2605.05117,
title = {On immanants of Cayley tables},
author = {Xuan Wang and Hanbin Zhang},
journal= {arXiv preprint arXiv:2605.05117},
year = {2026}
}