Abstract
dc:description.abstractThis thesis introduces a combinatorial approach to compute the growth series of CAT(0) cube complexes. The method partitions the vertices into sets called ”colours,” where vertices of the same colour are geometrically similar. Specifically, for vertices x and y sharing a colour, the vertices ahead of them, relative to a fixed basepoint, have equivalent colours, and the number of adjacent vertices closer to the basepoint is equal.<br/><br/>When this colouring partition is finite, transitions between colours as one moves outward from the basepoint can be encoded in a finite transition matrix. This matrix determines the number of vertices at each distance n from the basepoint, enabling the computation of the growth series. We show that the resulting growth series is always a rational function.<br/><br/>We further establish that any CAT(0) cube complex admitting a proper, cellular, cocompact group action possesses a finite colouring partition. Consequently, every such complex has rational growth. We illustrate the utility of this method through applications to various CAT(0) cube complexes, with particular emphasis on the geometric realisations of right-angled groups.
Degree
thesis:*- Name dc:type.qualificationname
- Ph.D.
- Level dc:type.qualificationlevel
- doctoral
- Grantor dc:publisher.institution
- University of Southampton
- Year dc:date.issued
- 2026
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Davenport, George James
- Advisors dc:contributor.advisor
-
- Spakula, Jan
- Leary, Ian
- ORCID person:identifier.orcid
Rights
- Language dc:language
- English, eng