Fundamental groupoids of k-graphs
David Pask, John Quigg, Iain Raeburn
Abstract
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop a theory of the fundamental groupoid of a k-graph, and relate it to the fundamental groupoid of an associated graph called the 1-skeleton. We also explore the failure, in general, of k-graphs to faithfully embed into their fundamental groupoids.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.