Isoperimetric and isodiametric functions of groups

@article{Sapir1998IsoperimetricAI,
  title={Isoperimetric and isodiametric functions of groups},
  author={Mark V. Sapir and Jean-Camille Birget and Eliyahu Rips},
  journal={Annals of Mathematics},
  year={1998},
  volume={156},
  pages={345-466}
}
This is the first of two papers devoted to connections between asymptotic functions of groups and computational complexity. In particular, we show how to construct a finitely presented group with NP-complete word problem. One of the main results of this paper states that if a real number cx > 4 is computable in time 0 then na is equivalent ( "big O" ) to the Dehn function of a finitely presented group. The smallest isodiametric function of this group is n3°8/4. On the other hand, if na is… 
View PDF on arXiv
4 Citations
Highly Influential Citations
15
Background Citations
1
Methods Citations
1

4 Citations

A ug 2 01 8 The isoperimetric spectrum of finitely presented groups
The isoperimeric spectrum consists of all real positive numbers α such that O(nα) is the Dehn function of a finitely presented group. In this note we show how a recent result of Olshanskii completes…
The Groups of Richard Thompson and Complexity
  • J. Birget
  • Mathematics
    Int. J. Algebra Comput.
  • 2004
TLDR
It is shown that V contains all finite direct products of finitely generated free groups as subgroups with linear distortion, and that up to polynomial equivalence of functions, the following three sets are the same: the set of distortions of V, theSet of Dehn functions offinitely presented groups, and theset of time complexity functions of nondeterministic Turing machines.
Homological Dehn Functions And The Word Problem
S. M. Gersten Abstract. Homological Dehn functions over R and over Z are introduced to measure minimal fillings of integral 1-cycles by (real or integral) 2-chains in the Cayley 2complex of a…
Isoperimetric functions of groups and computational complexity of the word problem
We prove that the word problem of a finitely generated group G is in NP (solvable in polynomial time by a nondeterministic Turing machine) if and only if this group is a subgroup of a finitely…
SPACE FUNCTIONS OF GROUPS
We consider space functions s(n) of finitely presented groups G = 〈A | R〉. (These functions have a natural geometric analog.) To define s(n) we start with a word w over A of length at most n equal to…
SPACE FUNCTIONS OF GROUPS
We consider space functions s(n) of finitely presented groups G = 〈A | R〉. (These functions have a natural geometric analog.) To define s(n) we start with a word w over A of length at most n equal to…
The Post correspondence problem in groups
TLDR
It is shown that one of the strongest forms of the word problem in a group G can be reduced to 𝐍𝐏𝐂𝐄n in G in polynomial time, and the bounded 𝏽𝓂𝓸 is 𝓽-complete in non-elementary hyperbolic groups and non-abelian right angle Artin groups.
A REMARK ON GROUPS OF BIRATIONAL TRANSFORMATIONS AND THE WORD PROBLEM (AFTER YVES DE CORNULIER)
In these notes, I present a result due to Yves de Cornulier. According to it, any finitely generated subgroup of the Cremona group has a solvable word problem. This provides examples of finitely…
A Note on Square Rooting of Time Functions of Turing Machines
TLDR
The deterministic version of this conjecture is shown to be false, which means that for every rational number α, 0 < α < 1, there is a deterministic time function T = (n2) such that T α is not equivalent to any time function of a Deterministic Turing machine.
Groups finitely presented in Burnside varieties