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

被引:0
|
作者
Genevois, Anthony [1 ]
机构
[1] Univ Montpellier, Inst Math Alexander Grothendieck, Pl Eugene Bataillon, F-34090 Montpellier, France
关键词
quasi-median graphs; crossing graph; contact graph; translation length; graph products of groups; GARSIDE GROUP; SUBGROUPS; NUMBERS; HYPERBOLICITY; GEOMETRY;
D O I
10.4171/GGD/822
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Given a quasi-median graph X, the crossing graph AX and the contact graph FX are natural hyperbolic models of X. In this article, we show that the asymptotic translation length in AX or FX of an isometry of X is always rational. Moreover, if X 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 X 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.
引用
收藏
页码:343 / 391
页数:49
相关论文
共 50 条
  • [41] A Note on Cycle Lengths in Graphs
    R.J. Gould
    P.E. Haxell
    A.D. Scott
    Graphs and Combinatorics, 2002, 18 : 491 - 498
  • [42] Cycle Lengths in Expanding Graphs
    Friedman, Limor
    Krivelevich, Michael
    COMBINATORICA, 2021, 41 (01) : 53 - 74
  • [43] Cycle lengths in sparse graphs
    Sudakov, Benny
    Verstraetet, Jacques
    COMBINATORICA, 2008, 28 (03) : 357 - 372
  • [44] Pair lengths of product graphs
    Christofides, Demetres
    DISCRETE MATHEMATICS, 2006, 306 (17) : 2111 - 2114
  • [45] Unavoidable cycle lengths in graphs
    Verstraete, J
    JOURNAL OF GRAPH THEORY, 2005, 49 (02) : 151 - 167
  • [46] LENGTHS OF CYCLES IN HALIN GRAPHS
    BONDY, JA
    LOVASZ, L
    JOURNAL OF GRAPH THEORY, 1985, 9 (03) : 397 - 410
  • [47] Cycle lengths in sparse graphs
    Benny Sudakov
    Jacques Verstraëte
    Combinatorica, 2008, 28 : 357 - 372
  • [48] On the Eulerian recurrent lengths of complete bipartite graphs and complete graphs
    Jimbo, Shuji
    2014 INTERNATIONAL CONFERENCE ON MANUFACTURING, OPTIMIZATION, INDUSTRIAL AND MATERIAL ENGINEERING (MOIME 2014), 2014, 58
  • [49] Controlling Underestimation Bias in Reinforcement Learning via Quasi-median Operation
    Wei, Wei
    Zhang, Yujia
    Liang, Jiye
    Li, Lin
    Li, Yuze
    THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 8621 - 8628
  • [50] A tight axiomatization of the median procedure on median graphs
    Mulder, Henry Martyn
    Novick, Beth
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (06) : 838 - 846