Almost convex groups
Let \(\Gamma\) be the Cayley graph of an infinite group G, with edges labelled by some generating set C \((=C^{-1})\) for G. One may define d(x,y), the distance between vertices x and y of \(\Gamma\), and let \(B(n)=\{x|\) d(x,e)\(\leq n\}\) and \(S(n)=\{x|\) \(d(x,e)=n\}\), where the vertex e is the identity element of G. The graph \(\Gamma\) is called almost convex (k) that exists an integer N(k) such that if x,y\(\in S(n)\), any n, and d(x,y)\(\leq k\) then x and y are joined in B(n) by a path of length \(\leq N(k)\); and \(\Gamma\) is almost convex if it is almost convex (k) for all k. The purpose of the definition is that it provides for an effective construction of \(\Gamma\) : if \(\Gamma\) is almost convex, then there is a finite algorithm that, at stage n, constructs B(n). The paper then goes on to show that many of the groups classically studied in combinatorial group theory (e.g. free products with amalgamation, HNN-extensions, small cancellation) and geometric groups (e.g. cocompact hyperbolic, negative curvature or euclidean) are almost convex.
- scientific article; zbMATH DE number 3125737 (Why is no real title available?)
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 3224578 (Why is no real title available?)
- scientific article; zbMATH DE number 3191321 (Why is no real title available?)
- On torsion-free groups with infinitely many ends
- The combinatorial structure of cocompact discrete hyperbolic groups
- \(k\)-weakly almost convex groups and \(\pi_ 1^ \infty \widetilde M^ 3\)
- Thompson's group \(F\) is not almost convex.
- The loop shortening property and almost convexity.
- A non-Hopfian almost convex group.
- The Heisenberg group is pan-rational
- A group with deep pockets for all finite generating sets.
- Coxeter groups are almost convex
- \(L_\delta\) groups are almost convex and have a sub-cubic Dehn function.
- Almost convex groups and the eight geometries
- Almost linear Nash groups
- Higher rank cocompact convex groups
- Iterated Minkowski sums, horoballs and north-south dynamics
- Injective hulls of certain discrete metric spaces and groups.
- Tame filling invariants for groups
- PATTERNS THEORY AND GEODESIC AUTOMATIC STRUCTURE FOR A CLASS OF GROUPS
- scientific article; zbMATH DE number 431371 (Why is no real title available?)
- FOREST DIAGRAMS FOR ELEMENTS OF THOMPSON'S GROUP F
- Computing word length in alternate presentations of Thompson's group \(F\).
- Multifractal Analysis for Gibbs Ground States
- Statistical hyperbolicity in groups.
- Measuring the tameness of almost convex groups
- Structure of geodesics in the Cayley graph of infinite Coxeter groups
- scientific article; zbMATH DE number 781750 (Why is no real title available?)
- Growth of a PSL2R Manifold Group
- A uniform model for almost convexity and rewriting systems
- Intrinsic tame filling functions are equivalent to intrinsic diameter functions
- A Cayley graph for F2 × F2 which is not minimally almost convex
- Deep pockets in lattices and other groups.
- Growth in Baumslag-Solitar groups. II: The Bass-Serre tree
- Connectedness of spheres in Cayley graphs
- A geometric approach to the almost convexity and growth of some nilpotent groups
- Rational Growth and Almost Convexity of Higher-Dimensional Torus Bundles
- Shortcut graphs and groups
- On k-geodetic graphs and groups
- Graphs with convex balls
- Almost convexity on Abelian groups
- Tame combing and almost convexity conditions.
- Constructing metric spaces from systems of walls
This page was built for publication: Almost convex groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085276)
