Orderly Algorithm to enumerate central groupoids and their graphs
Abstract
A graph has the unique path property UPPn if there is a unique path of length n between any ordered pair of nodes. This paper reiterates Royle and MacKay's technique for constructing orderly algorithms. We wish to use this technique to enumerate all UPP2 graphs of small orders 9 and 16. We attempt to use the direct graph formalism and find that the algorithm is inefficient. We introduce a generalised problem and derive algebraic and combinatoric structures with appropriate structure. We are able to then design an orderly algorithm to determine all UPP2 graphs of order 9, which runs fast enough. We hope to be able to determine the UPP2 graphs of order 16 in the near future.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.