On a Combinatorial Characterization of Abelian Group Actions
Let $G$ be a finite abelian group of order $n$ and $X$ a finite $G$-set. We give a necessary and sufficient condition on $G$ for any $X$ to be determined up to isomorphism by certain combinatorial data. Specifically, if $M_H^X$ is the number of $H$-orbits in $X$, and $a_d^X$ is the number of $G$-orbits in $X$ of cardinality $d$, we characterize when equalities $M_H^{X_1} = M_H^{X_2}$ and $a_d^{X_1}=a_d^{X_2}$ for all $H \leq G$ and $d|n$, respectively, force an isomorphism $X_1 \simeq X_2$. Our main result is that this occurs if and only if $G$ is cyclic or $G$ is the direct sum of a finite cyclic group and a cyclic group of prime order. We conclude with an arithmetic application to $L$-function factorization.
math.GR↗