Related papers: Knapsack Problems for Wreath Products

In [F. Caselli, Involutory reflection groups and their models, J. Algebra 24 (2010), 370--393] it is constructed a uniform Gelfand model for all non-exceptional irreducible complex reflection groups which are involutory. This model can be…

A group $G$ with conjugation operation is a rack. We call such racks \emph{group racks}. In this paper we study finite group racks via their subrack lattices. Heckenberger, Shareshian, and Welker proved that the isomorphism type of the…

We show that Submonoid Membership is decidable in n-dimensional lamplighter groups $(\mathbb{Z}/p\mathbb{Z}) \wr \mathbb{Z}^n$ for any prime $p$ and integer $n$. More generally, we show decidability of Submonoid Membership in semidirect…

We characterize permutational wreath products with Property (FA). For instance, the standard wreath product A wr B of two nontrivial countable groups A,B, has Property (FA) if and only if B has Property (FA) and A is a finitely generated…

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…

We study the seeded domino problem, the recurring domino problem and the $k$-SAT problem on finitely generated groups. These problems are generalization of their original versions on $\mathbb{Z}^2$ that were shown to be undecidable using…

In this note we observe that any compact quantum group monoidally equivalent, in a nice way, to a free wreath product of a compact quantum group $G$ by the quantum automorphism group of a finite dimensional C*-algebra with a $\delta$-form…

We study the bounded cohomology and the stable commutator length of verbal wreath products $\Gamma \wr^{_W}A$, where $A$ has trivial bounded cohomology for a sufficiently large class of coefficients.\\ We prove that the stable commutator…

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

Let $G$ be a finitely generated group. We prove that the $n$-fold tensor product $G^{\otimes n}$ is finite (resp. polycyclic) if and only $G$ is finite (resp. polycyclic). Further, assuming that $G$ is finitely presented, we show that…

Consider the wreath product $H\wr G$, where $H\ne 1$ is finite and $G$ is finitely generated. We show that the Assouad-Nagata dimension $\dim_{AN}(H\wr G)$ of $H\wr G$ depends on the growth of $G$ as follows: If the growth of $G$ is not…

The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…

There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by $\sim_p$,…

A conjunctive query (CQ) is semantically acyclic if it is equivalent to an acyclic one. Semantic acyclicity has been studied in the constraint-free case, and deciding whether a query enjoys this property is NP-complete. However, in case the…

We give a simple and unified proof showing that the unrestricted wreath product of a weakly sofic, sofic, linear sofic, or hyperlinear group by an amenable group is weakly sofic, sofic, linear sofic, or hyperlinear, respectively. By means…

We develop general methods to compute the algebraic $K$-theory of crossed products by Bernoulli shifts on additive categories. From this we obtain a $K$-theory formula for regular group rings associated to wreath products of finite groups…

The Farrell-Jones Fibered Isomorphism Conjecture for the stable topological pseudoisotopy theory has been proved for several classes of groups. For example for discrete subgroups of Lie groups, virtually poly-infinite cyclic groups, Artin…

In this paper we study residual solvability of the amalgamated product of two finitely generated free groups, in the case of doubles. We find conditions where this kind of structure is residually solvable, and show that in general this is…

Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give rise to a discrete complexity class between NP and PSPACE. Several problems, mostly from real algebraic geometry / polynomial systems, have been shown complete…

We characterise the group property of being with infinite conjugacy classes for wreath products of groups