1. Counting problems in graph products and relatively hyperbolic groups
- Author
-
Samuel J. Taylor, Giulio Tiozzo, and Ilya Gekhtman
- Subjects
Large class ,Full density ,Cayley graph ,General Mathematics ,010102 general mathematics ,Coxeter group ,Geometric Topology (math.GT) ,Dynamical Systems (math.DS) ,Group Theory (math.GR) ,0102 computer and information sciences ,01 natural sciences ,Graph ,Combinatorics ,Mathematics - Geometric Topology ,Counting problem ,010201 computation theory & mathematics ,FOS: Mathematics ,Mathematics - Dynamical Systems ,0101 mathematics ,Mathematics - Group Theory ,Word metric ,Mathematics - Abstract
We study properties of generic elements of groups of isometries of hyperbolic spaces. Under general combinatorial conditions, we prove that loxodromic elements are generic (i.e., they have full density with respect to counting in balls for the word metric in the Cayley graph) and translation length grows linearly. We provide applications to a large class of relatively hyperbolic groups and graph products, including all right-angled Artin groups and right-angled Coxeter groups.
- Published
- 2020
- Full Text
- View/download PDF