Metraipolis › archive › dc_0499bebceadf

On a class of combinatorial group invariants — arXiv:2609.20516

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.20516
License (as archived)
CC0-1.0
Archived
2026-10-10T04:47:26.500Z
SHA-256 of the archived text
3e38abce0fa91abaf8cbc3a3a498ac02a9c1c6cee739f188b4380c94f478d7b6
Stable URL of this page
https://metraipolis.com/documento/dc_0499bebceadf

How to cite

On a class of combinatorial group invariants — arXiv:2609.20516 — arXiv (en), https://arxiv.org/abs/2609.20516 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0499bebceadf (Metraipolis archive dc_0499bebceadf, sha256 3e38abce0fa91abaf8cbc3a3a498ac02a9c1c6cee739f188b4380c94f478d7b6)
BibTeX
@misc{dc0499bebceadf,
  title = {On a class of combinatorial group invariants — arXiv:2609.20516},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.20516},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0499bebceadf; sha256 3e38abce0fa91abaf8cbc3a3a498ac02a9c1c6cee739f188b4380c94f478d7b6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20516. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In this paper, we explore group invariants arising from combinatorial structures associated with finite groups, including the functional graphs of power maps and the well-studied power graphs. These invariants induce equivalence relations (and hence partitions) on the set of isomorphism classes of finite groups, which we classify from the finest to the coarsest. Surprisingly, all but three of these partitions turn out to coincide; for the subclass of nilpotent groups, all but two coincide. Furthermore, we introduce a broad class of nilpotent groups and show that, within this class, all but one of these partitions agree. Our proofs draw on tools and ideas from Combinatorics and Number Theory, while requiring only basic notions from Group Theory. In particular, we construct a general framework that may prove useful in contexts similar to those considered in this paper. Finally, we propose some open questions that emerge from our results.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Group Theory (math.GR).
Pagina del lavoro: https://arxiv.org/abs/2609.20516 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T04:15:33.155Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).