Related papers: Knapsack Problems for Wreath Products
In this paper we construct finite dimensional representations of the wreath product symplectic reflection algebra H(k,c,N,G) of rank N attached to a finite subgroup G of SL(2,C) (here k is a number and c a class function on the set of…
In this paper we show that membership in finitely generated submonoids is undecidable for the free metabelian group of rank 2 and for the wreath product $\mathbb Z\wr (\mathbb Z\times \mathbb Z)$. We also show that subsemimodule membership…
For a finitely generated group $G$, the \emph{Diophantine problem} over $G$ is the algorithmic problem of deciding whether a given equation $W(z_1,z_2,\ldots,z_k) = 1$ (perhaps restricted to a fixed subclass of equations) has a solution in…
A variant of the classical knapsack problem is considered in which each item is associated with an integer weight and a qualitative level. We define a dominance relation over the feasible subsets of the given item set and show that this…
We prove that, given a finitely generated subgroup $H$ of a free group $F$, the following questions are decidable: is $H$ closed (dense) in $F$ for the pro-(met)abelian topology? is the closure of $H$ in $F$ for the pro-(met)abelian…
In this paper we give an example of a linear group such that its tensor square is not linear. Also, we formulate some sufficient conditions for the linearity of non-abelian tensor products $G \otimes H$ and tensor squares $G \otimes G$.…
The Sequential Multiple Knapsack Problem is a special case of Multiple knapsack problem in which the items sizes are divisible. A characterization of the optimal solutions of the problem and a description of the convex hull of all the…
Let G be a finite group acting on the finite set X such that the corresponding (complex) permutation representation is multiplicity free. There is a natural rank and order preserving action of the wreath product G~S_n on the generalized…
The original knapsack problem is well known to be NP-complete. In a multidimensional version one have to decide whether a $p\in \N^k$ is in a sumset-sum of a set $X \subseteq \N^k$ or not. In this paper we are going to investigate a…
The irreducible character values of the spin wreath products of the symmetric group and an arbitrary finite group are completely determined.
The Knapsack problem is one of the most fundamental NP-complete problems at the intersection of computer science, optimization, and operations research. A recent line of research worked towards understanding the complexity of…
A result of Baumslag and Roseblade states that a finitely presented subgroup of the direct product of two free groups is virtually a direct product of free groups. In this paper we generalise this result to the class of cyclic subgroup…
We show the existence of finitely presented torsion-free groups with decidable word problem that cannot be embedded in any finitely generated group with decidable conjugacy problem. This answers a well-known question of Collins from the…
In the present paper, for a pair $(G,N)$ of a group $G$ and its normal subgroup $N$, we consider the mixed commutator length $\mathrm{cl}_{G,N}$ on the mixed commutator subgroup $[G,N]$. We focus on the setting of wreath products: $…
The RP-property of Fel'shtyn and Troitsky is proved for wreath products of finitely generated Abelian groups with the group of integers. Such wreath products become the first known example of finitely generated RP-groups being not almost…
We investigate which free constructions (amalgamated products and HNN-extensions) over word hyperbolic groups produce groups that are again word hyperbolic. A complete answer is obtained for the case when the amalgamated subgroups are…
An example of an extension of a completely simple semigroup U by a group H is given which cannot be embedded into the wreath product of U by H. On the other hand, every central extension of U by H is shown to be embeddable in the wreath…
In this work we introduce a new succinct variant of the word problem in a finitely generated group $G$, which we call the power word problem: the input word may contain powers $p^x$, where $p$ is a finite word over generators of $G$ and $x$…
The braid group has recently attracted much attention. This is primarily based upon the discovery of its usage in various cryptosystems [AAG],[KLCHKP]. One major focus of current research has been in solving decision problems in braid…
We study groups of reversible cellular automata, or CA groups, on groups. More generally, we consider automorphism groups of subshifts of finite type on groups. It is known that word problems of CA groups on virtually nilpotent groups are…