Related papers: An explicit algorithm for the Higman Embedding The…

We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group…

The aim of this thesis is to determine classes of NP relations for which random generation and approximate counting problems admit an efficient solution. Since efficient rank implies efficient random generation, we first investigate some…

We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we…

To a finite group G one can associate a tower of wreath products S_n[G]. It is well known that the graded direct sum of the Grothendieck groups of the categories of finite dimensional complex representations of these groups can be given the…

An embedding construction $G\hookrightarrow H$ for groups $G$ with a length function was introduced by the author earlier. Here we obtain new properties of this embedding, answering some questions raised by M.V. Sapir. In particular, an…

Let $n \geq 3$. In this paper, we study the problem of whether a given finite group $G$ embeds in a quotient of the form $B_n/\Gamma_k(P_n)$, where $B_n$ is the $n$-string Artin braid group, $k \in \{2, 3\}$, and $\{\Gamma_l(P_n)\}_{l\in…

We consider finitely presented,residually finite groups $G$ and finitely generated normal subgroups $A$ such that the inclusion $A\hookrightarrow G$ induces an isomorphism from the profinite completion of $A$ to a direct factor of the…

Power circuits are data structures which support efficient algorithms for highly compressed integers. Using this new data structure it has been shown recently by Myasnikov, Ushakov and Won that the Word Problem of the one-relator Baumslag…

Motivated by quotient algorithms, such as the well-known $p$-quotient or solvable quotient algorithms, we describe how to compute extensions $\tilde H$ of a finite group $H$ by a direct sum of isomorphic simple $\mathbb{Z}_p H$-modules such…

We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are interpreted over constructor terms (representing data values),…

We prove that every virtually free group $G$ has property (LR) of Long and Reid: each finitely generated subgroup of $G$ is a retract of a finite index subgroup. The main ingredient in the proof is a new embedding result stating that every…

We exhibit examples of finitely presented subgroups $P$ of direct products of hyperbolic groups for which there is no algorithm that detects whether a finitely presented group has a quotient isomorphic to $P$. For any torsion-free, linear,…

The submonoid membership problem for a finitely generated group $G$ is the decision problem, where for a given finitely generated submonoid $M$ of $G$ and a group element $g$ it is asked whether $g \in M$. In this paper, we prove that for a…

We explore an elementary construction that produces finitely presented groups with diverse homological finiteness properties -- the {\em binary subgroups}, $B(\Sigma,\mu)<G_1\times\dots\times G_m$. These full subdirect products require…

We investigate accessible subgroups of a profinite group $G$, i.e. subgroups $H$ appearing as vertex groups in a graph of profinite groups decomposition of $G$ with finite edge groups. We prove that any accessible subgroup $H \leq G$ arises…

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 prove that if a subgroup $H$ of the automorphism group $\mathrm{Aut}(\Sigma^{\mathbb{Z}})$ of a non-trivial full shift acts on points of finite support with a free orbit, then for every finitely-generated abelian group $A$, the abstract…

These notes expand upon our lectures on {\em profinite rigidity} at the international colloquium on randomness, geometry and dynamics, organised by TIFR Mumbai at IISER Pune in January 2024. We are interested in the extent to which groups…

We study the intersection of finitely generated factor-free subgroups of free products of groups by utilizing the method of linear programming. For example, we prove that if $H_1$ is a finitely generated factor-free noncyclic subgroup of…

Let E be a division ring and G a finite group of automorphisms of E whose elements are distinct modulo inner automorphisms of E. Given a representation \rho: B-> GL(d,E) of an F-algebra B, we give necessary and sufficient conditions for…