Results 31 to 40 of about 353 (136)
Computing the Gromov hyperbolicity of a discrete metric space
We give exact and approximation algorithms for computing the Gromov hyperbolicity of an n-point discrete metric space. We observe that computing the Gromov hyperbolicity from a fixed base-point reduces to a (max,min) matrix product. Hence, using the (max,
Vigneron, Antoine E. +6 more
core +1 more source
A characterization of Gromov hyperbolicity of surfaces with variable negative curvature [PDF]
In this paper we show that, in order to check Gromov hyperbolicity of any surface with curvature K≤ -k² < 0, we just need to verify the Rips condition on a very small class of triangles, namely, those contained in simple closed geodesics. This result is,
Tourís, Eva +3 more
core +1 more source
Gromov Hyperbolicity, John Spaces, and Quasihyperbolic Geodesics
We show that every quasihyperbolic geodesic in a John space admitting a roughly starlike Gromov hyperbolic quasihyperbolization is a cone arc. This result provides a new approach to the elementary metric geometry question, formulated in \cite[Question 2]{Hei89}, which has been studied by Gehring, Hag, Martio and Heinonen. As an application, we obtain a
Qingshan Zhou, Yaxiang Li, Antti Rasila
openaire +3 more sources
A new characterization of Gromov hyperbolicity for negatively curved surfaces
In this paper we show that to check Gromov hyperbolicity of any surface of constant negative curvature, or, Riemann surface, we only need to verify the Rips condition on a very small class of triangles, namely, those obtained by marking three points in a
Tourís, E., Rodríguez, J. M.
core
Computing the Gromov hyperbolicity constant of a discrete metric space
Although it was invented by Mikhail Gromov, in 1987, to describe some family of groups[1], the notion of Gromov hyperbolicity has many applications and interpretations in different fields.
Ismail, Anas
core +1 more source
Uniform growth in small cancellation groups
Abstract An open question asks whether every group acting acylindrically on a hyperbolic space has uniform exponential growth. We prove that the class of groups of uniform uniform exponential growth acting acylindrically on a hyperbolic space is closed under taking certain geometric small cancellation quotients.
Xabier Legaspi, Markus Steenbock
wiley +1 more source
Sublinear bilipschitz equivalence and the quasiisometric classification of solvable Lie groups
Abstract We prove a product theorem for sublinear bilipschitz equivalences which generalizes the classical work of Kapovich, Kleiner, and Leeb on quasiisometries between product spaces. We employ our product theorem to distinguish up to quasiisometry certain families of solvable groups which share the same dimension, cone‐dimension and Dehn function ...
Ido Grayevsky, Gabriel Pallier
wiley +1 more source
Gromov hyperbolic groups and the Macaev norm [PDF]
Let \(\Gamma\) be a Gromov hyperbolic group with a finite set \(A\) of generators. One can consider three quantities: the Coornaert-Papadopoulos topological entropy \(h_{top}(\Sigma(\infty))\) of the subshift associated to \((\Gamma,A)\), Voiculescu's invariant \(k^-_\infty(\lambda_A)\), and the growth entropy \(\text{gr}(\Gamma,A)\). The author proves
openaire +2 more sources
Circle packings, renormalizations, and subdivision rules
Abstract In this paper, we use iterations of skinning maps on Teichmüller spaces to study circle packings and develop a renormalization theory for circle packings whose nerves satisfy certain subdivision rules. We characterize when the skinning map has bounded image.
Yusheng Luo, Yongquan Zhang
wiley +1 more source
Graph potentials and topological quantum field theories
Abstract We introduce a new functional equation in birational geometry, whose solutions can be used to construct two‐dimensional topological quantum field theories (2d TQFTs), infinite‐dimensional in many interesting examples. The solutions of the equation give rise to a hierarchy of graph potentials, which, in the simplest setup, are Laurent ...
Pieter Belmans +2 more
wiley +1 more source

