Free and fragmenting filling length
The filling length of an edge-circuit \eta in the Cayley 2-complex of a finite presentation of a group is the least integer L such that there is a combinatorial null-homotopy of \eta down to a base point through loops of length at most L. We introduce similar notions in which the null-homotopy is no...
Autors principals: | Bridson, M, Riley, T |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
2005
|
Ítems similars
-
Extrinsic versus intrinsic diameter for Riemannian filling-discs and van
Kampen diagrams
per: Bridson, M, et al.
Publicat: (2005) -
Extrinsic versus intrinsic diameter for Riemannian filling-discs and van
Kampen diagrams
per: Bridson, M, et al.
Publicat: (2009) -
Length functions, curvature, and the dimension of discrete groups
per: Bridson, M
Publicat: (2001) -
Polynomial Dehn functions and the length of asynchronously automatic structures
per: Bridson, M
Publicat: (2002) -
Profinite completions of free-by-free groups contain everything
per: Bridson, MR
Publicat: (2024)