Related papers: Knapsack Problems for Wreath Products
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 provide a necessary and sufficient condition for the restricted wreath product $A\wr B$ to be $\mathcal{C}$-hereditarily conjugacy separable where $\mathcal{C}$ is an extension-closed pseudovariety of finite groups. Moreover, we prove…
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
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 that Knapsack problem (KP) is undecidable for any group of nilpotency class two if the number of generators (without torsion) of the derived subgroup is at least 322. This result together with the fact that if KP is undecidable for…
We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…
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…
By means of analyzing the notion of verbal products of groups, we show that soficity, hyperlinearity, amenability, the Haagerup property, the Kazhdan's property (T) and exactness are preserved under taking $k$-nilpotent products of groups,…
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…
We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight line programs defined…
Invariable generation is a topic that has predominantly been studied for finite groups. In 2014, Kantor, Lubotzky, and Shalev produced extensive tools for investigating invariable generation for infinite groups. Since their paper, various…
Given the large class of groups already known to be sofic, there is seemingly a shortfall in results concerning their permanence properties. We address this problem for wreath products, and in particular investigate the behaviour of more…
A permutation group is innately transitive if it has a transitive minimal normal subgroup, which is referred to as a plinth. We study the class of finite, innately transitive permutation groups that can be embedded into wreath products in…
We study relationship among versions of the Knapsack Problem where variables take values in Z and the number of them is fixed. In particular, we construct a finitely presented group where the problem of solvability of exponential equations…
Wreath products such as Z wr Z are not finitely-presentable yet can occur as subgroups of finitely presented groups. Here we compute the distortion of Z wr Z as a subgroup of Thompson's group F and as a subgroup of Baumslag's metabelian…
We study generalisations of conjugacy separability in restricted wreath products of groups. We provide an effective upper bound for $\mathcal{C}$-conjugacy separability of a wreath product $A \wr B$ in terms of the $\mathcal{C}$-conjugacy…
It is known that the bounded Geodesic Length Problem in free metabelian groups is NP-complete (in particular, the Geodesic Problem is NP-hard). We construct a 2-approximation polynomial time deterministic algorithm for the Geodesic Problem.…
Connectivity is a homotopy invariant property of a separable C*-algebra A which has three important consequences: absence of nontrivial projections, quasidiagonality and realization of the Kasparov group KK(A,B) as homotopy classes of…
We study the Hopf property for wreath products of finitely generated groups, focusing on the case of an abelian base group. Our main result establishes a strong connection between this problem and Kaplansky's stable finiteness conjecture.…
We prove that a wreath product of an abelian group and a non-amenable group is not strongly Ulam stable. Previously this was known for groups containing free subgroups, due to work of Burger, Ozawa and Thom, and for some surface groups, due…