Related papers: Equations in wreath products

In this paper we show that Diophantine problem for quadratic equations in Baumslag-Solitar groups $BS(1,k)$ and in wreath products $A \wr \mathbb{Z}$, where $A$ is a finitely generated abelian group and $\mathbb{Z}$ is an infinite cyclic…

In this paper we study the complexity of solving orientable quadratic equations in wreath products $A\wr B$ of finitely generated abelian groups. We give a classification of cases (depending on genus and other characteristics of a given…

In this paper we prove that the Diophantine problem in iterated restricted wreath products $G$ of arbitrary non-trivial free abelian groups $A_1,\ldots, A_k$, $k>1$ of finite ranks is undecidable, i.e., there is no algorithm that given a…

In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It turns out that decidability of knapsack is not preserved under…

We prove that the Diophantine problem for spherical quadratic equations in free metabelian groups is solvable and, moreover, NP-complete

For a finitely generated group $G$, the \emph{Diophantine problem} over $G$ is the algorithmic problem of deciding whether a given equation $W(z_1,z_2,\ldots,z_k) = 1$ (perhaps restricted to a fixed subclass of equations) has a solution in…

We describe an effective version of the conjugacy problem and study it for wreath products and free solvable groups. The problem involves estimating the length of short conjugators between two elements of the group, a notion which leads to…

We prove that the Diophantine problem for orientable quadratic equations in free metabelian groups is decidable and furthermore, NP-complete. In the case when the number of variables in the equation is bounded, the problem is decidable in…

We prove that the complexity of the Conjugacy Problems for wreath products and for free solvable groups is decidable in polynomial time. For the wreath product AwrB, we must assume the decidability in polynomial time of the Conjugacy…

We introduce a notion of partition wreath product of a finite group by a partition quantum group, a construction motivated on the one hand by classical wreath products and on the other hand by the free wreath product of J. Bichon. We…

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

We present a survey of our recent research on varieties, generated by wreath products of groups. In particular, the full classification of all cases, when the (cartesian or direct) wreath product of any abelian groups $A$ and $B$ generates…

We prove the A-theoretic Isomorphism Conjecture with coefficients and finite wreath products for solvable groups.

In this paper, we show that wreath products of groups have linear divergence, and we generalise the argument to permutational wreath products. We also prove that Houghton groups $\mathcal{H}_m$ with $m\geq 2$ and Baumslag-Solitar groups…

Given a morphism $\varphi : G \to A \wr B$ from a finitely presented group $G$ to a wreath product $A \wr B$, we show that, if the image of $\varphi$ is a sufficiently large subgroup, then $\mathrm{ker}(\varphi)$ contains a non-abelian free…

We study one-variable equations over the lamplighter group $\MZ_2 \wr \MZ$. While the decidability of arbitrary equations over $L_2$ remains open, we prove that the Diophantine problem for single equations in one variable is decidable. Our…

We prove that groups in a certain class of metabelian locally compact groups, have quadratic Dehn function. As an application, we embed the solvable Baumslag-Solitar groups into finitely presented metabelian groups with quadratic Dehn…

We prove that the wreath product orbifolds studied earlier by the first author provide a large class of higher dimensional examples of orbifolds whose orbifold Hodge numbers coincide with the ordinary ones of suitable resolutions of…

We provide an algorithm which, for a given quadratic equation in the Grigorchuk group determines if it has a solution. As a corollary to our approach, we prove that the group has a finite commutator width.

We prove that the wreath product $C=A wr B$ of a semigroup $A$ with zero and an infinite cyclic semigroup $B$ is $q_\omega$-compact (logically Noetherian). Our result partially solves the Plotkin`s problem about wreath products