English

Associating hypergraphs defined on loops

Combinatorics 2024-08-30 v1 Group Theory

Abstract

In this paper, we define a new hypergraph H(V,E)\mathcal{H(V,E)} on a loop LL, where V\mathcal{V} is the set of points of the loop LL and E\mathcal{E} is the set of hyperedges e={x,y,z}e=\{x,y,z\} such that x,yx,y and zz associate in the order they are written. We call this hypergraph as the associating hypergraph on a loop LL. We study certain properites of associating hypergraphs on the Moufang loop M(Dn,2)M(D_n,2), where DnD_n denotes the dihedral group of order 2n2n.

Keywords

Cite

@article{arxiv.2408.16459,
  title  = {Associating hypergraphs defined on loops},
  author = {Siddharth Malviy and Vipul Kakkar},
  journal= {arXiv preprint arXiv:2408.16459},
  year   = {2024}
}
R2 v1 2026-06-28T18:27:34.600Z