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...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2005
|