Related papers: The complexity of knapsack problems in wreath prod…
In this paper a relation between iterated cyclings and iterated powers of elements in a Garside group is shown. This yields a characterization of elements in a Garside group having a rigid power, where 'rigid' means that the left normal…
In this paper we compute powers in the wreath product $G\wr S_n$, for any finite group $G$. For $r\geq 2$, a prime, consider $\omega_r: G\wr S_n\to G\wr S_n$ defined by $g \mapsto g^r$. Let $P_{r}(G\wr S_n)=\frac{|\omega_r(G\wr S_n)|}{|G|^n…
Waring's classical problem deals with expressing every natural number as a sum of g(k) k-th powers. Recently there has been considerable interest in similar questions for nonabelian groups, and simple groups in particular. Here the k-th…
This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…
We consider II$_1$ factors of the form $M=\bar{\bigotimes}_{G}N\rtimes G$, where either i) $N$ is a non-hyperfinite II$_1$ factor and $G$ is an ICC amenable group or ii) $N$ is a weakly rigid II$_1$ factor and $G$ is ICC group and where $G$…
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…
Let v and w be nontrivial words in two free groups. We prove that, for all sufficiently large finite non-abelian simple groups G, there exist subsets C of v(G) and D of w(G) of size such that every element of G can be realized in at least…
Baumslag-Solitar groups were introduced in 1962 by Baumslag and Solitar as examples for finitely presented non-Hopfian two-generator groups. Since then, they served as examples for a wide range of purposes. As Baumslag-Solitar groups are…
We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…
We prove that a self-similar free abelian group has finite rank. We apply the result to self-similar wreath products of abelian groups $G=BwrX$. We show that if $X$ is torsion-free, then $B$ is torsion of finite exponent. Furthemore, we…
In this paper we prove several results regarding decidability of the membership problem for certain submonoids in amalgamated free products and HNN extensions of groups. These general results are then applied to solve the prefix membership…
With each semigroup one can associate a partial algebra, called the biordered set, which captures important algebraic and geometric features of the structure of idempotents of that semigroup. For a biordered set $\mathcal{E}$, one can…
We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.
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 construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…
We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…
We consider the product knapsack problem, which is the variant of the classical 0-1 knapsack problem where the objective consists of maximizing the product of the profits of the selected items. These profits are allowed to be positive or…
We introduce a new class of groups called wreath-like products. These groups are close relatives of the classical wreath products and arise naturally in the context of group theoretic Dehn filling. Unlike ordinary wreath products, many…
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…
We begin with a review of the notion of a braid group. We then discuss some known solutions to decision problems in braid groups. We then move on to proving new results in braid group algorithmics. We offer a quick solution to the…