Translation lengths in crossing and contact graphs of (quasi-)median graphs

preprint2022arXivOpen access

Abstract

Given a quasi-median graph XX, the crossing graph ΔXΔX and the contact graph ΓXΓX are natural hyperbolic models of XX. In this article, we show that the asymptotic translation length in ΔXΔX or ΓXΓX of an isometry of XX is always rational. Moreover, if XX is hyperbolic, these rational numbers can be written with denominators bounded above uniformly; this is not true in full generality. Finally, we show that, if the quasi-median graph XX is constructible in some sense, then there exists an algorithm computing the translation length of every computable isometry. Our results encompass contact graphs in CAT(0) cube complexes and extension graphs of right-angled Artin groups.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.