Related papers: Compressed word problems in HNN-extensions and ama…

The cyclically reduced product of two words $u, v$, denoted $u * v$, is the cyclically reduced form of the concatenation of $u$ by $v$. This product is not associative. Recently S. V. Ivanov has proved that the Andrews-Curtis conjecture can…

Let G be a finitely generated infinite pro-p group acting on a pro-p tree such that the restriction of the action to some open subgroup is free. Then we prove that G splits as a pro-p amalgamated product or as a pro-p HNN-extension over an…

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…

We prove that the word problem of the Brin-Thompson group nV over a finite generating set is coNP-complete for every n \ge 2. It is known that the groups nV are an infinite family of infinite, finitely presented, simple groups. We also…

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…

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 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…

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.

A conjecture of Boone and Higman from the 1970's asserts that a finitely generated group $G$ has solvable word problem if and only if $G$ can be embedded into a finitely presented simple group. We comment on the history of this conjecture…

We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the bounded submonoid membership problem, are P-time…

We investigate the structure of subdirect products of groups, particularly their finiteness properties. We pay special attention to the subdirect products of free groups, surface groups and HNN extensions. We prove that a finitely presented…

For a first-order theory $T$, the Constraint Satisfaction Problem of $T$ is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of $T$. In this article we develop sufficient…

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…

We propose a general conjecture on decompositions of finite simple groups as products of conjugates of an arbitrary subset. We prove this conjecture for bounded subsets of arbitrary finite simple groups, and for large subsets of groups of…

We study the lattice of finite-index extensions of a given finitely generated subgroup $H$ of a free group $F$. This lattice is finite and we give a combinatorial characterization of its greatest element, which is the commensurator of $H$.…

*by a standard (one-tape) Turing machine. It is well-known that the word problem for hyperbolic groups, whence in particular for free groups, can be solved in linear time. However, these algorithms run on machines more complicated than a…

A finitely generated group $G$ is said to be condensed if its isomorphism class in the space of finitely generated marked groups has no isolated points. We prove that every product variety $\mathcal{UV}$, where $\mathcal{U}$ (respectively,…

Some completely positive maps on reduced amalgamated free products of C*-algebras are constructed; these allow a proof that the class of exact unital C*-algebras is closed under taking reduced amalgamated free products. Consequently, the…

The Boone--Higman conjecture is that every recursively presented group with solvable word problem embeds in a finitely presented simple group. We discuss a brief history of this conjecture and work towards it. Along the way we describe some…

The category of crossed complexes gives an algebraic model of CW-complexes and cellular maps. Free crossed resolutions of groups contain information on a presentation of the group as well as higher homological information. We relate this to…