The Group Permanent Determines the Finite Abelian Group

Let $G$ be a finite abelian group of order $n$ and $\mathcal M_G$ the Cayley table of $G$. Let $\mathcal P(G)$ be the number of formally different monomials occurring in $\mathsf {per}(\mathcal M_G)$, the permanent of $\mathcal M_G$. In this paper, for any finite abelian groups $G$ and $H$, we prove the following characterization $$\mathcal P(G)=\mathcal P(H)\ \Leftrightarrow\ G\cong H.$$ It follows that the group permanent determines the finite abelian group, which partially answers an open question of Donovan, Johnson and Wanless. In fact, $\mathcal P(G)$ is closely related to zero-sum sequences over finite abelian groups and we shall prove the above characterization by studying a reciprocity of zero-sum sequences over finite abelian groups. As an application of our method, we show that $\mathcal P(G)>\mathcal P(C_n)$ for any non-cyclic abelian group $G$ of order $n$ and thereby answer an open problem of Panyushev.

Authors

Institutions

Publication Details

Journal
The Electronic Journal of Combinatorics
Published
2024-11-15
DOI
https://doi.org/10.37236/13332
Citations
1
Primary Topic
semigroups and automata theory
Type
article
Field-Weighted Citation Impact
0.36
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Group Permanent Determines the Finite Abelian Group

Hanbin Zhang, Maosheng Li
1 citations
The Electronic Journal of Combinatorics
semigroups and automata theory
0.36
article

The Group Permanent Determines the Finite Abelian Group

Hanbin Zhang, Maosheng Li
article en
1 citations

Abstract

Let $G$ be a finite abelian group of order $n$ and $\mathcal M_G$ the Cayley table of $G$. Let $\mathcal P(G)$ be the number of formally different monomials occurring in $\mathsf {per}(\mathcal M_G)$, the permanent of $\mathcal M_G$. In this paper, for any finite abelian groups $G$ and $H$, we prove the following characterization $$\mathcal P(G)=\mathcal P(H)\ \Leftrightarrow\ G\cong H.$$ It follows that the group permanent determines the finite abelian group, which partially answers an open question of Donovan, Johnson and Wanless. In fact, $\mathcal P(G)$ is closely related to zero-sum sequences over finite abelian groups and we shall prove the above characterization by studying a reciprocity of zero-sum sequences over finite abelian groups. As an application of our method, we show that $\mathcal P(G)>\mathcal P(C_n)$ for any non-cyclic abelian group $G$ of order $n$ and thereby answer an open problem of Panyushev.

The Electronic Journal of CombinatoricsVol. 31(4)
Sun Yat-sen University (CN)
Openalex Percentile: Top 34%
semigroups and automata theory
0.36
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.