Related papers: Asymptotic invariants, complexity of groups and re…
This is a survey of the recent work in algorithmic and asymptotic properties of groups. I discuss Dehn functions of groups, complexity of the word problem, Higman embeddings, and constructions of finitely presented groups with extreme…
We construct a finitely presented group with undecidable word problem and with Dehn function bounded by a quadratic function on an infinite set of positive integers.
We study the interrelation of space functions of groups and the space complexity of the algorithmic word problem in groups.
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…
We introduce a new invariant of bipartite chord diagrams and use it to construct the first examples of groups with Dehn function $n^2\log n$ and other small Dehn functions. Some of these groups have undecidable conjugacy problem.
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…
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…
The computational complexity of the word problem in HNN-extension of groups is studied. HNN-extension is a fundamental construction in combinatorial group theory. It is shown that the word problem for an ascending HNN-extension of a group H…
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…
We prove foundational results for homological Dehn functions of groups of type $FP_2$ such as superadditivity and the invariance under quasi-isometry. We then study the homological Dehn functions of Leary's groups $G_L(S)$ providing methods…
This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…
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…
Computations in the cohomology of finite groups.
Filling functions are asymptotic invariants of finitely presentable groups; the seminal work on the subject is by M.Gromov. They record features of combinatorial homotopy discs (van Kampen diagrams) filling loops in Cayley 2-complexes.…
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…
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…
A survey of some results and open questions related to the following algebraic invariants of compact complex manifolds, that can be obtained from differential forms: cohomology groups, Chern classes, rational homotopy groups, and higher…
This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has…
We present the notion of injective hom-complexity, leading to a connection between the covering number of a group and the sectional number of a group homomorphism, and provide estimates for computing this invariant.
We review computations of joint invariants on a linear symplectic space, discuss variations for an extension of group and space and relate this to other equivalence problems and approaches, most importantly to differential invariants.