Related papers: Free-by-cyclic groups have solvable conjugacy prob…

Let $N$ be a finitely generated nilpotent group. Algorithm is constructed such, that for every automorphism $\phi \in Aut(N)$ defines the Reidemeister number $R(\phi).$ It is proved that any free nilpotent group of rank $r = 2$ or $r = 3$…

Let F_2 be a free group of rank 2. We prove that there is an algorithm that decides whether or not, for given two elements u, v of F_2, u and v are translation equivalent in F_2, that is, whether or not u and v have the property that the…

Let $G$ be the generalized free product of two groups with an amalgamated subgroup. We propose an approach that allows one to use results on the residual $p$-finiteness of $G$ for proving that this generalized free product is residually a…

We generalize the classical Post correspondence problem ($\mathbf{PCP}_n$) and its non-homogeneous variation ($\mathbf{GPCP}_n$) to non-commutative groups and study the computational complexity of these new problems. We observe that…

We prove that every countable group with solvable power problem embeds into a finitely presented 2-generated group with solvable power and conjugacy problems.

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

A finitely generated group G is termed parafree if it is residually nilpotent and it has the same isomorphism types of nilpotent quotients as some free group. The two main results of this MSc. Thesis characterise the parafreeness of two…

We give a positive answer, in the measurable-group-theory context, to von Neumann's problem of knowing whether a non-amenable countable discrete group contains a non-cyclic free subgroup. We also get an embedding result of the free-group…

This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more…

This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…

Let $G$ be a free product of two groups with amalgamated subgroup, $\pi$ be either the set of all prime numbers or the one-element set \{$p$\} for some prime number $p$. Denote by $\Sigma$ the family of all cyclic subgroups of group $G$,…

We study groups of reversible cellular automata, or CA groups, on groups. More generally, we consider automorphism groups of subshifts of finite type on groups. It is known that word problems of CA groups on virtually nilpotent groups are…

An algorithm is proposed that solves two decision problems for pseudo-Anosov elements in the mapping class group of a surface with at least one marked fixed point. The first problem is the root problem: decide if the element is a power and…

The paper is devoted to the study of free objects in the variety of Steiner loops and of the combinatorial structures behind them, focusing on their automorphism groups. We prove that all automorphisms are tame and the automorphism group is…

By strengthening known results about primitivity-blocking words in free groups, we prove that for any nontrivial element w of a free group of finite rank, there are words that cannot be subwords of any cyclically reduced automorphic image…

It is proved that generalized free product of two finite p-groups is a conjugacy p-separable group if and only if it is residually finite p-groups. This result is then applied to establish some sufficient conditions for conjugacy…

Let F be an infinitely generated free group and R a fully invariant subgroup of F such that (a) R is contained in the commutator subgroup F' of F and (b) the quotient group F/R is residually torsion-free nilpotent. Then the automorphism…

We study the word and conjugacy problems in lacunary hyperbolic groups (briefly, LHG). In particular, we describe a necessary and sufficient condition for decidability of the word problem in LHG. Then, based on the graded small-cancellation…

We prove the Freiheitssatz for right-symmetric algebras and the decidability of the word problem for right-symmetric algebras with a single defining relation. We also prove that two generated subalgebras of free right-symmetric algebras are…

In this article, we solve the twisted conjugacy problem for solvable Baumslag--Solitar groups $BS(n,1)$, i.e., we propose an algorithm which, given two elements $u,v \in BS(n,1)$ and an automorphism $\varphi \in \Aut(BS(n,1))$, decides…