Related papers: Knapsack Problems for Wreath Products

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 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…

We show that any infinite collection $(\Gamma_n)_{n\in \mathbb N}$ of icc, hyperbolic, property (T) groups satisfies the following von Neumann algebraic \emph{infinite product rigidity} phenomenon. If $\Lambda$ is an arbitrary group such…

Given a finite group $G$ and positive integers $r$ and $s$, a problem of interest in algebra is determining the minimum cardinality of the product set $AB$, where $A$ and $B$ are subsets of $G$ such that $|A|=r$ and $|B|=s$. This problem…

We present a full description of the Bieri-Neumann-Strebel invariant of restricted permutational wreath products of groups. We also give partial results about the 2-dimensional homotopical invariant of such groups. These results may be…

We consider the class of finitely generated groups which have a normal form computable in logspace. We prove that the class of such groups is closed under finite extensions, finite index subgroups, direct products, wreath products, and also…

We study the effects of subgroup distortion in the wreath products A wr Z, where A is finitely generated abelian. We show that every finitely generated subgroup of A wr Z has distortion function equivalent to some polynomial. Moreover, for…

A wreath product is a method to construct an association scheme from two association schemes. We determine the automorphism group of a wreath product. We show a known result that a wreath product is Schurian if and only if both components…

In analogy to the disjoint cycle decomposition in permutation groups, Ore and Specht define a decomposition of elements of the full monomial group and exploit this to describe conjugacy classes and centralisers of elements in the full…

We introduce a new technique to prove connectivity of subsets of covering spaces (so called inductive connectivity), and apply it to Galois theory of problems of enumerative geometry. As a model example, consider the problem of permuting…

0-1 Knapsack is a fundamental NP-complete problem. In this article we prove that it remains NP-complete even when the weights of the objects in the packing constraints and their values in the objective function satisfy specific stringent…

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…

The aim of the present paper is to generalize the notion of the group determinants for finite groups. For a finite group $G$ of order $kn$ and its subgroup $H$ of order $n$, one may define an $n$ by $kn$ matrix $X=(x_{hg^{-1}})_{h\in H,g\in…

We show that amenability, the Haagerup property, the Kazhdan's property (T) and exactness are preserved under taking second nilpotent product of groups. We also define the restricted second nilpotent wreath product of groups, this is a…

Let $A$ be a nilpotent $p$-group of finite exponent, and $B$ be an abelian $p$-groups of finite exponent. Then the wreath product $A {\rm Wr} B$ generates the variety ${\rm var}(A) {\rm var}(B)$ if and only if the group $B$ contains a…

The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…

In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many…

The aim of this paper is to investigate whether the class of automaton semigroups is closed under certain semigroup constructions. We prove that the free product of two automaton semigroups that contain left identities is again an automaton…

We study a constrained version of the knapsack problem in which dependencies between items are given by the adjacencies of a graph. In the 1-neighbour knapsack problem, an item can be selected only if at least one of its neighbours is also…

We prove that for many nonamenable groups \Gamma, including all hyperbolic groups and all nontrivial free products, the left-right wreath product group G := (Z/2Z)^(\Gamma) \rtimes (\Gamma \times \Gamma) is W*-superrigid. This means that…