2000 character limit reached
Associating hypergraphs defined on loops
Published 29 Aug 2024 in math.CO and math.GR | (2408.16459v1)
Abstract: In this paper, we define a new hypergraph $\mathcal{H(V,E)}$ on a loop $L$, where $\mathcal{V}$ is the set of points of the loop $L$ and $\mathcal{E}$ is the set of hyperedges $e={x,y,z}$ such that $x,y$ and $z$ associate in the order they are written. We call this hypergraph as the associating hypergraph on a loop $L$. We study certain properites of associating hypergraphs on the Moufang loop $M(D_n,2)$, where $D_n$ denotes the dihedral group of order $2n$.
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.