The Double exponential Theorem for isodiametric and isoperimetric Functions

نویسنده

  • S. M. Gersten
چکیده

The relevant definitions of terms occurring in the statement are as follows. If P = 〈x1, x2, . . . , xp | R1, R2, . . .Rq〉 is a finite presentation, we shall denote by G = G(P) the associated group; here G = F/N , where F is the free group freely generated by the generators x1, . . . , xp and N is the normal closure of the relators. If w is an element of F (which we may identify with a reduced word in the free basis), we write `(w) for the length of the word w and we write w =G 1 to mean that w represents the identity element of G. We shall make use of the terminology of van Kampen diagrams [L-S, p. 235ff]. We write AreaP (w) for the minimum number of faces (i.e 2-cells) in a van Kampen diagram with boundary label w. Equivalently, AreaP(w) is the minimum number of relators or inverses of relators occurring in all expressions of w as a product (in F ) of their conjugates. The function f : → is an isoperimetric function for P if, for all n and all words w with `(w) ≤ n and w =G 1, we have AreaP(w) ≤ f(n). The minimal isoperimetric function for P is called its Dehn function. If D is a van Kampen diagram with boundary label w, we choose the base point v0 in the boundary of D corresponding to where one starts reading the boundary label w and one defines

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isodiametric and Isoperimetric Inequalities for Complexes and Groups

It is shown that D. Cohen’s inequality bounding the isoperimetric function of a group by the double exponential of its isodiametric function is valid in the more general context of locally finite simply connected complexes. It is shown that in this context this bound is ‘best possible ’. Also studied are seconddimensional isoperimetric functions for groups and complexes. It is shown that the se...

متن کامل

Functions on Groups and Computational Complexity

We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the computational complexity of the word problem (deterministic time, nondeterministic time, symmetric space). We show that the isoperimetric function can always be linear...

متن کامل

Isoperimetric and Isodiametric Functions of Finite Presentations

We survey current work relating to isoperimetric functions and isodiametric functions of finite presentations. §

متن کامل

Quantitative Stability in the Isodiametric Inequality via the Isoperimetric Inequality

The isodiametric inequality is derived from the isoperimetric inequality trough a variational principle, establishing that balls maximize the perimeter among convex sets with fixed diameter. This principle brings also quantitative improvements to the isodiametric inequality, shown to be sharp by explicit nearly optimal sets.

متن کامل

Filling Length in Finitely Presentable Groups

Filling length measures the length of the contracting closed loops in a null-homotopy. The filling length function of Gromov for a finitely presented group measures the filling length as a function of length of edge-loops in the Cayley 2-complex. We give a bound on the filling length function in terms of the log of an isoperimetric function multiplied by a (simultaneously realisable) isodiametr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJAC

دوره 1  شماره 

صفحات  -

تاریخ انتشار 1991