Related papers: Equations in wreath products
We show that the Diophantine problem(decidability of equations) is undecidable in free associative algebras over any field and in the group algebras over any field of a wide variety of torsion free groups, including toral relatively…
Given two finitely generated groups that coarsely embed into a Hilbert space, it is known that their wreath product also embeds coarsely into a Hilbert space. We introduce a wreath product construction for general metric spaces X,Y,Z and…
We prove new complexity results for computational problems in certain wreath products of groups and (as an application) for free solvable group. For a finitely generated group we study the so-called power word problem (does a given…
We recover a 4-dimensional wreath product X as a transversal slice to a nilpotent orbit in sp_6. By using deformations of Springer resolutions, we construct a symplectic deformation of symplectic resolutions of X.
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…
In this paper we study the complexity of solving quadratic equations in the lamplighter group. We give a complete classification of cases (depending on genus and other characteristics of a given equation) when the problem is…
In this paper we study the satisfiability and solutions of group equations when combinatorial, algebraic and language-theoretic constraints are imposed on the solutions. We show that the solutions to equations with length, lexicographic…
The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…
There is a long-standing problem of algebra to extend the symmetric monoidal structure of abelian groups, given by the tensor product, to a non abelian setting. In this paper we show that such an extension is possible. Morover our non…
In this note, we show that the satisfiability of equations and inequations with recognisable constraints is decidable in groups that are virtually direct products of finitely many hyperbolic groups.
The automorphism group of the composition of graphs $G \circ H$ contains the wreath product $Aut(H) \wr Aut(G)$ of the automorphism groups of the corresponding graphs. The classical problem considered by Sabidussi and Hemminger was under…
In this paper we obtain a new parametric solution of the problem of finding two triads of biquadrates with equal sums and equal products.
Let $A$ be an abelian group. We consider sufficient conditions for the combinatorial wreath product $A \wr_X B$ to be Hopfian generalising results of Bradford and Fournier-Facio. For an integer $m \geq 2$ we show an example where…
We define wreath products of cocommutative Hopf algebras, and show that they enjoy a universal property of classifying cleft extensions, analogous to the Kaloujnine-Krasner theorem for groups. We show that the group ring of a wreath product…
The knapsack problem for groups was introduced by Miasnikov, Nikolaev, and Ushakov. It is defined for each finitely generated group $G$ and takes as input group elements $g_1,\ldots,g_n,g\in G$ and asks whether there are $x_1,\ldots,x_n\ge…
In the 1980's K.S. Brown proved that the Houghton group $H_n$ is of type $\operatorname{F}_{n-1}$ but not $\operatorname{FP}_n$. We show that, provided $n\ge3$, the same conclusion holds for all subgroups $G$ of $H_n$ that are 'large' in…
We study the Diophantine problem, i.e. the decision problem of solving systems of equations, for some families of one-relator groups, and provide some background for why this problem is of interest. The method used is primarily the…
We show that the Diophantine problem in Thompson's group F is undecidable. Our proof uses the facts that F has finite commutator width and rank 2 abelianisation, then uses similar arguments used by B\"uchi and Senger and Ciobanu and Garreta…
We examine the conjugacy growth series of all wreath products of the finitary permutation groups $\text{Sym}(X)$ and $\text{Alt}(X)$ for an infinite set $X$. We determine their asymptotics, and we characterize the limiting behavior between…
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…