This page contains info about some of my publications. Most of the work done after 1992 has been supported by the National Science Foundation.
In May, 2004, we finished a large paper with Cornelia Drutu where we study asymptotic cones of groups and tree-graded spaces.
Several recent papers have been posted to the arXive. This includes our paper with Alexander Borisov where we prove that every ascendig HNN extension of a linear group is residually finite and some related results about periodic points of polynomial maps over finite fields.
In January 2003, we finished (with Victor Guba) a new paper about diagram groups. We proved that diagram groups can be realized as fundamental groups of positive paths of directed 2-complexs, computed homology groups and Poincare series of diagram groups over complete finite complexes, found F_\infty diagram groups containing all countable diagram groups, etc. The paper is 42 pages long.
In October, 2002, we finished (with A.Yu. Olshanskii) a large paper where we proved that a finitely generated group G has solvable conjugacy problem if and only if it can be Frattini embedded into a finitely presented group with solvable conjugacy problem. This solves a problem by Collins (the paper is 120 pages long).
In December of 2000, A.Yu. Olshanskii and I finished a large paper where we construct the first finitely presented non-amenable group without free non-abelian subgroups. This group is torsion of exponent n>>1 by cyclic. So it satisfies the law [x,y]^n=1. This is a finitely presented counterexample to von Neumann's conjecture. What is possibly more important, this can be considered the first finitely presented "monster". Previously known "monsters" like a finitely generated infinite group with all subgroups cyclic of prime order and others (constructed by A.Yu. Olshanskii in 1979), are limits of hyperbolic groups and cannot be finitely presented. The paper is 105 pages long. It is going to appear in #96 of Publications of IHES, 2002.
Here is a shorter (10 pages) version of the previous paper. It is published Electronic Research Announcements (2002). No proofs but the main ideas are explained.
Here is our paper with Stuart Margolis and Pascal Weil about closed subgroups in pro-V-topologies of free groups. We prove that it is decidable whether a f.g. subgroup of a free group is closed in pro-nil topology. Thus we find an algorithm to decide given a set of partial permutations of a finite set whether this set is extendable to a nilpotent group of permutations of a finite set. It is still unknown if one can replace "nilpotent" by "solvable" in this statement. The length - 49 pages (published in IJAC 2001).
Here is our paper with Victor Guba where we prove that a diagram group contains a copy of the Thompson group F if and only if the corresponding directed complex contains a copy of the Dunce hat. Thus there exists a rigid connection between the Thompson group and the Dunce hat. The paper is 11 pages long (published in IJAC, 2002).
Here is our new paper with Victor Guba about Diagram groups where we prove that nilpotent subgroups of diagram groups are abelian, abelian subgroups are always free, the class of diagram groups is closed under the so called diagram product (free and direct products are particular cases of the diagram product), show that not every subgroup of a diagram group is a diagram group itself, find a distorted subgroup of the R. Thmopson group F, etc. The paper is 56 pages long. It is published in Mat. Sbornik (August 1999).
Here is a paper (joint with Olshanskii) where we present easy quasi-isometric embeddings of relatively free groups in finitely based varieties (in particular, the free Burnside groups) and Baumslag-Solitar groups into finitely presented groups with small Dehn functions. The paper is 23 pages long. It is published in Contemporary Mathematics, 264 (2000).
Here is my paper about amalgams of finite semigroups. I prove that the embeddability into any semigroup (ring) and the embeddability into finite semigroups (rings) of finite amalgams of semigroups (rings) is undecidable. The paper is published in J. Algebra (1999).
Here is the survey about Dehn functions and length distortion in groups that we have just finished writing with A.Yu. Olshanskii (Oct. 12, 1998, revised in August, 1999). It is 35 pages long. To see the HTML version of the survey, click here. The paper is published in IJAC (2000).
Paper "Quadratic isoperimetric functions for Heisenberg groups. A combinatorial proof" (joint with Olshanskii) is available here. The paper is only 8 pages long. It is published in Algebra, 11. J. Math. Sci. (New York) 93 (1999).
A paper (joint with Birget, Olshanskii and Rips) about isoperimetric
functions of groups and computational complexity (finished in May 1998) is
In particular, we proved that a finitely generated group G has word problem in
NP if and only if G is a subgroup of a finitely presented group H with
polynomial Dehn function (moreover this subgroup has bounded length
distortion). The paper is 47 pages long, it is poublished in Annals of
This paper is based on the first paper (joint with Birget and Rips),
finished in May 1997, where we described Dehn functions of groups. One of the
results: if alpha is a number > 4 such that the first m digits of alpha can be
computed by a Turing machine in time < 2(2^m) then nalpha is equivalent to the Dehn function of a finitely presented group. Conversely, if nalpha is the Dehn function of a finitely presented group then for every m the first m digits of alpha are computable in time < 22^(2^m). The paper is 107 pages long. To download it, click here. The paper is published in the Annals of Mathematics (2002)
With Victor Guba, we wrote a paper about subnegative Dehn functions where we prove that the Dehn function of every non-trivial free product of groups is subnegative, that is satisfies the condition f(m+n)>= f(m)+f(n). My conjecture that every Dehn function of a finitely presented group is equivalent to a subnegative function is still open. The paper is published in Proc. AMS, 1999.
During the week of May 20-25 of 1996, we wrote two papers together with Stanislav Kublanovsky. In the paper "A variety with undecidable set of subalgebras of finite simple algebras" we construct a finitely based variety of algebras with two binary operations where the embeddability into finite simple algebras is undecidable (in semigroups, rings and groups this problem is always decidable). In the paper "Potential divisibility in finite semigroups is undecidable", we prove that there is no algorithm to decide, given a finite semigroup (associative ring) S and two elements a and b in S, whether there exists a bigger semigroup (associative ring) T>S where a divides b. This solves a 30 years old problem by John Rhodes. Both papers are published in IJAC, 1999.
Here is the list of some of my other papers. In order to download a paper, click on its name: