SearcharxivSearch

arXiv · 2607.05698

Game Conductors of Finite Groups: Determinantal Torsion from Structured Payoff Probes

Abstract

We attach to a finite group $G$ and a structured payoff probe $\phi$ an integer \emph{payoff-difference lattice} $M_\phi(G)$ and its \emph{conductor} $C_\phi(G)$: the primes at which $M_\phi(G)$ loses rank modulo $p$. Our main result is an exact computation: for any CA-group the commuting conductor is rad$(b-1)$, where $b$ is the number of maximal abelian subgroups. In particular, conductor primes need not divide $|G|$: the prime $3$ occurs for a $2$-group of order $64$ with $b=7$. The commuting Smith spectrum is an invariant of the isoclinism class and obeys an exact direct-product law, giving ${\rm C_{comm}}(G\times H) = {\rm C_{comm}}(G) \cup {\rm C_{comm}}(H)$ unconditionally. A Galois-orbit-trace character probe reads a complementary layer: an index-$2$ subgroup forces $2\in {\rm C_{char}}(G)$ while no odd prime is forced, and ${\rm C_{comm}}(D_{2q}) = \{q\}$, ${\rm C_{char}}(D_{2q}) = \{2\}$ for all odd primes $q$. Certified exhaustive computation ($|G|\le128$ commuting, $|G|\le64$ character) and a deformation-family analysis support the general program: classify the Smith torsion of the compressed centralizer-type incidence matrix $B_G$.

Explore related subjects

Keep this discovery

BibTeXRIS

Matthew Fried. 2026-07-06. Game Conductors of Finite Groups: Determinantal Torsion from Structured Payoff Probes. https://arxiv.org/abs/2607.05698

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR