THE GALLERY LENGTH FILLING FUNCTION AND A GEOMETRIC INEQUALITY FOR FILLING LENGTH
AbstractWe 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. (Published Online April 18 2006)(Received October 10 2003) (Revised June 3 2005) Maths Classification 20F05 (primary); 20F06; 57M05; 57M20 (secondary). |