Papers
Topics
Authors
Recent
Search
2000 character limit reached

Path partial groups

Published 29 Jul 2021 in math.AT and math.GR | (2107.14084v6)

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)$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.