English
Related papers

Related papers: Groups with undecidable word problem and almost qu…

200 papers

We construct and study finitely presented groups with quadratic Dehn function (QD-groups) and present the following applications of the method developed in our recent papers. (1) The isomorphism problem is undecidable in the class of…

Group Theory · Mathematics 2020-12-21 A. Yu. Olshanskii , M. V. Sapir

We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.

Group Theory · Mathematics 2014-02-26 V. V. Bludov , A. M. W. Glass

We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…

Group Theory · Mathematics 2009-02-10 R. I. Grigorchuk , S. V. Ivanov

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…

Group Theory · Mathematics 2013-01-16 Desmond Cummins

We construct a finitely presented group $G$ with non-quadratic Dehn function $f$ majorizable by a quadratic function on arbitrary long intervals.

Group Theory · Mathematics 2007-05-23 A. Yu. Olshanskii

We construct a finitely presented group with quadratic Dehn function and undecidable conjugacy problem. This solves E. Rips' problem formulated in 1992. v2: misprints corrected. v3: lemmas 4.7, 4.10 corrected, more misprints fixed.

Group Theory · Mathematics 2019-10-28 Alexandr Yu. Olshanskii , Mark V. Sapir

In this survey we show how well known results about the Word Problem for finite group presentations can be generalized to the Word Problem and other decision problems for non-necessarily finite monoid and group presentations. This is done…

Group Theory · Mathematics 2019-08-27 Carmelo Vaccaro

We exhibit classes of groups in which the word problem is uniformly solvable but in which there is no algorithm that can compute finite presentations for finitely presentable subgroups. Direct products of hyperbolic groups, groups of…

Group Theory · Mathematics 2011-03-01 Martin R Bridson , Henry Wilton

We construct the first examples of finitely presented groups with quadratic Dehn function containing a finitely generated infinite torsion subgroup. These examples are "optimal" in the sense that the Dehn function of any such finitely…

Group Theory · Mathematics 2020-10-13 Francis Wagner

We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…

Group Theory · Mathematics 2013-03-25 O. Kharlampovich , A. Myasnikov , M. Sapir

It is shown that there exist infinitely many non-integers $r>2$ such that the Dehn function of some finitely presented group is $\simeq n^r$. For each positive rational number $s$ we construct pairs of finitely presented groups $H\subset G$…

Group Theory · Mathematics 2008-02-03 Martin Bridson

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

Group Theory · Mathematics 2026-03-30 Alexey Talambutsa

This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…

Group Theory · Mathematics 2025-09-23 Francis Wagner

We survey results about computational complexity of the word problem in groups, Dehn functions of groups and related problems.

Group Theory · Mathematics 2011-03-22 Mark Sapir

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

Group Theory · Mathematics 2021-10-27 Emmanuel Rauzy

In this paper, we compute an upper bound for the Dehn function of a finitely presented metabelian group. In addition, we prove that the same upper bound works for the relative Dehn function of a finitely generated metabelian group. We also…

Group Theory · Mathematics 2022-10-27 Wenhao Wang

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

Group Theory · Mathematics 2007-05-23 J. -C. Birget , A. Yu. Olshanskii , E. Rips , M. Sapir

We construct the first examples of finitely presented groups with cubic Dehn function containing a finitely generated infinite torsion subgroup. Moreover, we show that any infinite free Burnside group with sufficiently large odd exponent…

Group Theory · Mathematics 2020-01-13 Francis Wagner

We prove that Abels' group over an arbitrary nondiscrete locally compact field has a quadratic Dehn function. As applications, we exhibit connected Lie groups and polycyclic groups whose asymptotic cones have uncountable abelian fundamental…

Group Theory · Mathematics 2014-03-07 Yves Cornulier , Romain Tessera

We show the existence of finitely presented torsion-free groups with decidable word problem that cannot be embedded in any finitely generated group with decidable conjugacy problem. This answers a well-known question of Collins from the…

Group Theory · Mathematics 2019-12-02 Arman Darbinyan
‹ Prev 1 2 3 10 Next ›