English

On immanants of Cayley tables

Combinatorics 2026-05-07 v1

Abstract

Let GG be a finite abelian group of order nn and let MG=(xa+b)a,bG\mathcal M_G=(x_{a+b})_{a,b\in G} be the Cayley table of GG. Let immλ(MG)\text{imm}_\lambda(\mathcal M_G) be the immanant of MG\mathcal M_G with respect to a partition λ\lambda and Iλ(G)\mathcal I_\lambda(G) be the number of formally different monomials occurring in immλ(MG)\text{imm}_\lambda(\mathcal M_G) (in particular, we denote by P(G)\mathcal P(G) (resp. D(G)\mathcal D(G)) for the corresponding quantity for per(MG)\text{per}(\mathcal M_G) (resp. det(MG)\text{det}(\mathcal M_G)) for simplicity). The study of P(G)\mathcal P(G) and D(G)\mathcal D(G) lies at the intersection of algebraic combinatorics and additive combinatorics. In this paper, we prove the following results. (1) If G|G| is a prime power, then P(G)=D(G).\mathcal P(G)=\mathcal D(G). (2) If G|G| is odd, then I(n1,1)(G)=I(2,1n2)(G)=0,\mathcal I_{(n-1,1)}(G)= \mathcal I_{(2,1^{n-2})}(G)=0, and if G2(mod4)|G|\equiv 2\pmod 4, then I(n1,1)(G)=P(G)andI(2,1n2)(G)=D(G).\mathcal I_{(n-1,1)}(G)=\mathcal P(G)\quad \text{and}\quad \mathcal I_{(2,1^{n-2})}(G)=\mathcal D(G). (3) If G|G| is odd and G7|G|\ge 7, then imm(4,1n4)(MG)=imm(2,2,2,1n6)(MG). \text{imm}_{(4,1^{n-4})}(\mathcal M_G)=\text{imm}_{(2,2,2,1^{n-6})}(\mathcal M_G).

Keywords

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}
}