Associating hypergraphs defined on loops
Siddharth Malviy, Vipul Kakkar

TL;DR
This paper introduces a new hypergraph structure on loops, specifically on Moufang loops derived from dihedral groups, and explores its properties.
Contribution
It defines the associating hypergraph on loops and investigates its properties on Moufang loops related to dihedral groups.
Findings
Properties of associating hypergraphs on Moufang loops analyzed
Hypergraph structure linked to dihedral group properties
Potential applications in algebraic and combinatorial structures
Abstract
In this paper, we define a new hypergraph on a loop , where is the set of points of the loop and is the set of hyperedges such that and associate in the order they are written. We call this hypergraph as the associating hypergraph on a loop . We study certain properites of associating hypergraphs on the Moufang loop , where denotes the dihedral group of order .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Data Management and Algorithms · Advanced Database Systems and Queries
