Papers
Topics
Authors
Recent
Search
2000 character limit reached

Groupoids of finitely aligned higher-rank graphs via filters and graph morphisms

Published 17 Sep 2025 in math.RA and math.OA | (2509.13929v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.