Acyclicity in finite groups and groupoids
Abstract: We expound a concise construction of finite groups and groupoids whose Cayley graphs satisfy graded acyclicity requirements. Our acyclicity criteria concern cyclic patterns formed by coset-like configurations w.r.t. subsets of the generator set rather than just by individual generators. The proposed constructions correspondingly yield finite groups and groupoids whose Cayley graphs satisfy much stronger acyclicity conditions than large girth. We thus obtain generic and canonical constructions of highly homogeneous graph structures with strong acyclicity properties, which support known applications in finite graph and hypergraph coverings that locally unfold cyclic configurations.
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.