Table of Contents
Fetching ...

Path partial groups

Antonio Díaz Ramos, Rémi Molinier, Antonio Viruel

TL;DR

The paper establishes the universality of the category ${\mathcal{P}}art$, showing that every abstract group $H$ appears as ${\rm Aut}_{{\mathcal{P}}art}({\mathbb M})$ for infinitely many non-isomorphic partial groups ${\mathbb M}$. It constructs a graph-driven family ${\mathbb M}(G,{\mathcal H})$ that encodes graph automorphisms and vertex-group automorphisms, and it highlights the path specialisation ${\mathbb P}(G)={\mathbb M}(G,{\mathbb Z_2})$, for which ${\rm Aut}_{{\mathcal{P}}art}({\mathbb P}(G))\cong {\rm Aut}_{{\mathcal G}raphs}(G)$. A key result is that the graph $G$ can be recovered from the maximal locally finite-subgroup graph of ${\mathbb M}(G,{\mathcal H})$, linking graph-theoretical invariants to algebraic properties of partial groups. Together, these results provide a framework to study universality and rigidity in ${\mathcal{P}}art$ and to translate graph-theoretic data into partial-group invariants via path constructions and colimits.

Abstract

It is well known that not every finite group arises as the full automorphism group of some group. Here we show that the situation is dramatically different when considering the category of partial groups, ${{\mathcal P}art}$, as defined by Chermak: given any group $H$ there exists infinitely many non isomorphic partial groups ${\mathbb M}$ such that $\operatorname{Aut}_{{\mathcal P}art}({\mathbb M})\cong H$. To prove this result, given any simple undirected graph $G$ we construct a partial group ${\mathbb P}(G)$, called the path partial group associated to $G$, such that $\operatorname{Aut}_{{\mathcal P}art}\big({\mathbb P}(G)\big)\cong \operatorname{Aut}_{{\mathcal G}raphs}(G)$.

Path partial groups

TL;DR

The paper establishes the universality of the category , showing that every abstract group appears as for infinitely many non-isomorphic partial groups . It constructs a graph-driven family that encodes graph automorphisms and vertex-group automorphisms, and it highlights the path specialisation , for which . A key result is that the graph can be recovered from the maximal locally finite-subgroup graph of , linking graph-theoretical invariants to algebraic properties of partial groups. Together, these results provide a framework to study universality and rigidity in and to translate graph-theoretic data into partial-group invariants via path constructions and colimits.

Abstract

It is well known that not every finite group arises as the full automorphism group of some group. Here we show that the situation is dramatically different when considering the category of partial groups, , as defined by Chermak: given any group there exists infinitely many non isomorphic partial groups such that . To prove this result, given any simple undirected graph we construct a partial group , called the path partial group associated to , such that .

Paper Structure

This paper contains 7 sections, 14 theorems, 49 equations.

Key Result

Theorem 1

The category ${{\mathcal{P}}art}$ is universal. Moreover, given an abstract group $H$ there exist infinitely many non isomorphic partial groups ${\mathbb M}$ such that $\operatorname{Aut}_{{\mathcal{P}}art}({\mathbb M})\cong H$.

Theorems & Definitions (45)

  • Theorem 1: Theorem \ref{['thm:theorem_A']}
  • Corollary 2
  • Definition 1.2
  • Theorem 3: Theorem \ref{['thm:aut_of_partial_Z2']}
  • Definition 2.1
  • Remark 2.2
  • Example 2.3
  • Example 2.4
  • Definition 2.5
  • Definition 2.6
  • ...and 35 more