Associating hypergraphs defined on loops

Abstract

In this paper, we define a new hypergraph H(V,E) on a loop L, where V is the set of points of the loop L and 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(Dn,2), where Dn denotes the dihedral group of order 2n.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…