Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-10T14:25:03.511Z Has data issue: false hasContentIssue false

THE GALLERY LENGTH FILLING FUNCTION AND A GEOMETRIC INEQUALITY FOR FILLING LENGTH

Published online by Cambridge University Press:  18 April 2006

S. M. GERSTEN
Affiliation:
Department of Mathematics, 155S. 1400E., Room 233, University of Utah, Salt Lake City, UT 84112, USAgersten@math.utah.edu, www.math.utah.edu/~sg/
T. R. RILEY
Affiliation:
Department of Mathematics, 310 Malott Hall, Cornell University, Ithaca, NY 14853-4201, USAtim.riley@math.cornell.edu, www.math.cornell.edu/~tim.riley/
Get access

Abstract

We exploit duality considerations in the study of singular combinatorial 2-discs (diagrams) and are led to the following innovations concerning the geometry of the word problem for finite presentations of groups. We define a filling function called gallery length that measures the diameter of the 1-skeleton of the dual of diagrams; we show it to be a group invariant and we give upper bounds on the gallery length of combable groups. We use gallery length to give a new proof of the Double Exponential Theorem. Also we give geometric inequalities relating gallery length to the space-complexity filling function known as filling length.

Type
Research Article
Copyright
2006 London Mathematical Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)