Groupoids of finitely aligned higher-rank graphs via filters and graph morphisms
Abstract
Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly quasi-lattice ordered group, and we show the filter approach and the graph morphism approach yield isomorphic path and boundary-path groupoids. To do this, we define conjugacy of partial semigroup actions such that conjugate actions have isomorphic semidirect product groupoids. Combining our results with others in the literature, we survey many isomorphic presentations of path and boundary-path groupoids at different levels of generality.
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.