scholarly journals Stable commutator length in word-hyperbolic groups

2010 ◽  
pp. 59-90 ◽  
Author(s):  
Danny Calegari ◽  
Koji Fujiwara
Keyword(s):  
Hyperbolic Groups ◽  
Stable Commutator Length ◽  
Commutator Length ◽  
Word Hyperbolic Groups

scholarly journals Combable functions, quasimorphisms, and the central limit theorem

2009 ◽  
Vol 30 (5) ◽  
pp. 1343-1369 ◽  
Author(s):  
DANNY CALEGARI ◽  
KOJI FUJIWARA
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Word Length ◽  
Hyperbolic Groups ◽  
Finite State Automaton ◽  
List Type ◽  
Generating Sets ◽  
Finite State ◽  
Word Hyperbolic Groups

AbstractA function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite-state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left- and right-invariant word metrics. Examples of bicombable functions on word-hyperbolic groups include:(1)homomorphisms to ℤ;(2)word length with respect to a finite generating set;(3)most known explicit constructions of quasimorphisms (e.g. the Epstein–Fujiwara counting quasimorphisms).We show that bicombable functions on word-hyperbolic groups satisfy acentral limit theorem: if$\overline {\phi }_n$is the value of ϕ on a random element of word lengthn(in a certain sense), there areEandσfor which there is convergence in the sense of distribution$n^{-1/2}(\overline {\phi }_n - nE) \to N(0,\sigma )$, whereN(0,σ) denotes the normal distribution with standard deviationσ. As a corollary, we show that ifS1andS2are any two finite generating sets forG, there is an algebraic numberλ1,2depending onS1andS2such that almost every word of lengthnin theS1metric has word lengthn⋅λ1,2in theS2metric, with error of size$O(\sqrt {n})$.

scholarly journals Metric Characterizations of Superreflexivity in Terms of Word Hyperbolic Groups and Finite Graphs

2014 ◽  
Vol 2 (1) ◽  
Author(s):  
Mikhail Ostrovskii
Keyword(s):  
Hilbert Space ◽  
Hyperbolic Groups ◽  
Finite Graphs ◽  
Word Hyperbolic Groups

Abstract We show that superreflexivity can be characterized in terms of bilipschitz embeddability of word hyperbolic groups.We compare characterizations of superrefiexivity in terms of diamond graphs and binary trees.We show that there exist sequences of series-parallel graphs of increasing topological complexitywhich admit uniformly bilipschitz embeddings into a Hilbert space, and thus do not characterize superrefiexivity.

scholarly journals Surface groups, infinite generating sets, and stable commutator length

2019 ◽  
Vol 150 (5) ◽  
pp. 2379-2386
Author(s):  
Dan Margalit ◽  
Andrew Putman
Keyword(s):  
Mapping Class Group ◽  
Class Group ◽  
Surface Group ◽  
Mapping Class ◽  
Surface Groups ◽  
Closed Curves ◽  
Generating Set ◽  
Generating Sets ◽  
Stable Commutator Length ◽  
Commutator Length

AbstractWe give a new proof of a theorem of D. Calegari that says that the Cayley graph of a surface group with respect to any generating set lying in finitely many mapping class group orbits has infinite diameter. This applies, for instance, to the generating set consisting of all simple closed curves.

scholarly journals Stable commutator length in amalgamated free products

2015 ◽  
Vol 07 (04) ◽  
pp. 693-717 ◽  
Author(s):  
Tim Susse
Keyword(s):  
Geometric Model ◽  
Free Products ◽  
Cyclic Groups ◽  
Amalgamated Free Products ◽  
Torus Knot ◽  
Knot Complements ◽  
Stable Commutator Length ◽  
Free Abelian Groups ◽  
Commutator Length ◽  
Boundary Mapping

We show that stable commutator length is rational on free products of free abelian groups amalgamated over ℤk, a class of groups containing the fundamental groups of all torus knot complements. We consider a geometric model for these groups and parametrize all surfaces with specified boundary mapping to this space. Using this work we provide a topological algorithm to compute stable commutator length in these groups. Further, we use the methods developed to show that in free products of cyclic groups the stable commutator length of a fixed word varies quasirationally in the orders of the free factors.

scholarly journals SOLVING THE WORD PROBLEM IN REAL TIME

2001 ◽  
Vol 63 (3) ◽  
pp. 623-639 ◽  
Author(s):  
DEREK F. HOLT ◽  
SARAH REES
Keyword(s):  
Recent Result ◽  
Real Time ◽  
Word Problem ◽  
Turing Machine ◽  
Linear Time ◽  
Nilpotent Groups ◽  
Hyperbolic Groups ◽  
Turing Machines ◽  
Geometrically Finite ◽  
Word Hyperbolic Groups

The paper is devoted to the study of groups whose word problem can be solved by a Turing machine which operates in real time. A recent result of the first author for word hyperbolic groups is extended to prove that under certain conditions the generalised Dehn algorithms of Cannon, Goodman and Shapiro, which clearly run in linear time, can be programmed on real-time Turing machines. It follows that word-hyperbolic groups, finitely generated nilpotent groups and geometrically finite hyperbolic groups all have real-time word problems.

Hyperbolicity of some 2-generated one-relator groups

2002 ◽  
Vol 12 (4) ◽  
Author(s):  
N. B. Bezverkhnyaya
Keyword(s):  
Basic Research ◽  
Hyperbolic Groups ◽  
One Relator Groups ◽  
Basic Research Grant ◽  
Word Hyperbolic Groups ◽  
Research Grant

AbstractWe give the description of word hyperbolic groups of the form(a, b, t; tThe research was supported by the Russian Foundation for Basic Research, grant 00-01-00767.

AN UPPER BOUND FOR THE GROWTH OF CONJUGACY CLASSES IN TORSION-FREE WORD HYPERBOLIC GROUPS

2004 ◽  
Vol 14 (04) ◽  
pp. 395-401 ◽  
Author(s):  
MICHEL COORNAERT ◽  
GERHARD KNIEPER
Keyword(s):  
Upper Bound ◽  
Conjugacy Classes ◽  
Hyperbolic Groups ◽  
Word Hyperbolic Groups ◽  
Free Word ◽  
Torsion Free

We give a new upper bound for the growth of primitive conjugacy classes in torsion-free word hyperbolic groups.

Sign in / Sign up

Export Citation Format

Share Document