Computing the fundamental group of a higher-rank graph

  • Kang, S.
  • Pask, D.
  • Webster, S.B.G.
Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

We compute a presentation of the fundamental group of a higher-rank graph using a coloured graph description of higher-rank graphs developed by the third author. We compute the fundamental groups of several examples from the literature. Our results fit naturally into the suite of known geometrical results about higher-rank graphs when we show that the abelianization of the fundamental group is the homology group. We end with a calculation which gives a non-standard presentation of the fundamental group of the Klein bottle to the one normally found in the literature. Copyright © The Author(s), 2021. Published by Cambridge University Press on Behalf of The Edinburgh Mathematical Society.

키워드

fundamental groupHigher-rank graph
제목
Computing the fundamental group of a higher-rank graph
저자
Kang, S.Pask, D.Webster, S.B.G.
DOI
10.1017/S0013091521000420
발행일
2021-08
유형
Article
저널명
Proceedings of the Edinburgh Mathematical Society
64
3
페이지
650 ~ 661