Graph Immersions, Inverse Monoids, and Deck Transformations
Abstract
If f : → is a covering map between connected graphs, and H is the subgroup of π1(,v) used to construct the cover, then it is well known that the group of deck transformations of the cover is isomorphic to N(H)/H, where N(H) is the normalizer of H in π1(,v). We show that an entirely analogous result holds for immersions between connected graphs, where the subgroup H is replaced by the closed inverse submonoid of the inverse monoid L(,v) used to construct the immersion. We observe a relationship between group actions on graphs and deck transformations of graph immersions. We also show that a graph immersion f : → may be extended to a cover g : → in such a way that all deck transformations of f are restrictions of deck transformations of g.
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.