Path partial groups
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, Part, as defined by Chermak: given any group H there exists infinitely many non isomorphic partial groups M such that Aut Part( M) H. To prove this result, given any simple undirected graph G we construct a partial group P(G), called the path partial group associated to G, such that Aut Part( P(G)) Aut Graphs(G).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.