Related papers: The complexity of knapsack problems in wreath prod…

Let G denote either a special orthogonal group or a symplectic group defined over the complex numbers. We prove the following saturation result for G: given dominant weights \lambda^1, ..., \lambda^r such that the tensor product…

Let $w$ be a word in the free group of rank $n \in \mathbb{N}$ and let $\mathcal{V}(w)$ be the variety of groups defined by the law $w=1$. Define $\mathcal{V}(w^*)$ to be the class of all groups $G$ in which for any infinite subsets $X_1,…

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

Let f be an arbitrary positive integer valued function. The goal of this note is to show that one can construct a finitely generated group in which the discrete log problem is polynomially equivalent to computing the function f. In…

We use malleable deformations combined with spectral gap rigidity theory, in the framework of Popa's deformation/rigidity theory to prove unique tensor product decomposition results for II$_1$ factors arising as tensor product of wreath…

We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word problem in the automorphism group of such a group is decidable…

An algorithm is constructed that, when given an explicit presentation of a finitely generated nilpotent group $G,$ decides for any pair of endomorphisms $\varphi, \psi : G \to G$ and any pair of elements $u, v \in G,$ whether or not the…

We propose a new generalisation of Cayley automatic groups, varying the time complexity of computing multiplication, and language complexity of the normal form representatives. We first consider groups which have normal form language in the…

The Burnside Problem asks whether a finitely generated group of exponent n is finite. We present a solution for 2-generator groups of prime power exponent. Results of P. Hall and G. Higman extends the finiteness conclusion to groups having…

We introduce and study a novel generalization of the classical Knapsack Problem (KP), called the Colored Knapsack Problem (CKP). In this problem, the items are partitioned into classes of colors and the packed items need to be ordered such…

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

Let $\mathbb{G}$ be a compact quantum group and $\mathbb{G}^{aut}(B,\psi)$ be the quantum automorphism group of a finite dimensional C*-algebra $(B,\psi)$. In this paper, we study the free wreath product $\mathbb{G}\wr_{*}…

The classical Waring problem deals with expressing every natural number as a sum of g(k) kth powers. Similar problems for finite simple groups have been studied recently, and in this paper we study them for finite quasisimple groups G. We…

Given a sequence of $(G_i)_{i \in \N}$ of finite transitive groups of degree $n_i$, let $W_\infty$ be the inverse limit of the iterated permutational wreath products of the first m groups. We prove that $W_\infty$ is (topologically)…

In this survey we show how well known results about the Word Problem for finite group presentations can be generalized to the Word Problem and other decision problems for non-necessarily finite monoid and group presentations. This is done…

We consider the finitely generated groups acting on a regular tree with almost prescribed local action. We show that these groups embed as cocompact irreducible lattices in some locally compact wreath products. This provides examples of…

We discuss the time complexity of the word and conjugacy search problems for free products $G = A \star_C B$ of groups $A$ and $B$ with amalgamation over a subgroup $C$. We stratify the set of elements of $G$ with respect to the complexity…

We prove that every countable group with solvable power problem embeds into a finitely presented 2-generated group with solvable power and conjugacy problems.

In a recent paper, we defined twisted unitary $1$-groups and showed that they automatically induced error-detecting quantum codes. We also showed that twisted unitary $1$-groups correspond to irreducible products of characters thereby…

We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…