On Groupoids and Hypergraphs
Abstract
We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts transitions between colour classes (cosets). These groupoids are employed towards a generic construction method for finite hypergraphs that realise specified overlap patterns and avoid small cyclic configurations. The constructions are based on reduced products with groupoids generated by the elementary local extension steps, and can be made to preserve the symmetries of the given overlap pattern. In particular, we obtain highly symmetric, finite hypergraph coverings without short cycles. The groupoids and their application in reduced products are sufficiently generic to be applicable to other constructions that are specified in terms of local glueing operations and require global finite closure.
Cite
@article{arxiv.1211.5656,
title = {On Groupoids and Hypergraphs},
author = {Martin Otto},
journal= {arXiv preprint arXiv:1211.5656},
year = {2024}
}
Comments
Explicit completion of H in HxI (Section 2) is unstable (incompatible with restrictions), hence does not support inductive construction towards Prop. 2.17 based on Lem 2.16 as claimed. For corresponding technical result, now see arxiv:1806.08664; for discussion of main applications first announced here, now see arxiv:1709.00031