2000 character limit reached
Embeddable partial groups
Published 27 Jan 2026 in math.GR, math.AT, and math.CT | (2601.19772v1)
Abstract: We record a folklore theorem that says a partial group embeds in a group if and only if each word has at most one possible multiplication, regardless of choice of parenthesization. We further investigate the partial groups which are exemplars of non-embeddability. Finally we show that a partial groupoid embeds in a groupoid if and only if its reduction embeds in a group.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.