A bijection between aperiodic palindromes and connected circulant graphs
Abstract
In this paper, we show that there is a one-to-one correspondence between the set of compositions (resp. prime compositions) of n and the set of circulant digraphs (resp. connected circulant digraphs) of order n. We also show that there is a one-to-one correspondence between the set of palindromes (resp. aperiodic palindromes) of n and the set of circulant graphs (resp. connected circulant graphs) of order n. As a corollary of this correspondence, we enumerate the number of connected circulant (di)graphs of order n.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.