Related papers: Knapsack in hyperbolic groups

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

We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…

We study finite groups $G$ with the property that for any subgroup $M$ maximal in $G$ whose order is divisible by all the prime divisors of $|G|$, $M$ is supersolvable. We show that any nonabelian simple group can occur as a composition…

We show that for every $n\ge 2$ there exists a torsion-free one-ended word-hyperbolic group $G$ of rank $n$ admitting generating $n$-tuples $(a_1,\ldots ,a_n)$ and $(b_1,\ldots ,b_n)$ such that the $(2n-1)$-tuples $$(a_1,\ldots ,a_n,…

Every countable group $G$ can be embedded in a finitely generated group $G^*$ that is hopfian and complete, i.e. $G^*$ has trivial centre and every epimorphism $G^*\to G^*$ is an inner automorphism. Every finite subgroup of $G^*$ is…

In this paper we study the conjugacy problem in polycyclic groups. Our main result is that we construct polycyclic groups $G_n$ whose conjugacy problem is at least as hard as the subset sum problem with $n$ indeterminates. As such, the…

Let $G$ be a word hyperbolic group. We prove that the algebraic $K$-theory groups of $\dbZ [G]$, $K_n(\dbZ[G])$, have finite rank for all $n\in \dbZ$. For a few classes of groups, we give explicit formulas for the ranks of the algebraic…

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…

In the knapsack problems with neighborhood constraints that were studied before, the input is a graph $\mathcal{G}$ on a set $\mathcal{V}$ of items, each item $v \in \mathcal{V}$ has a weight $w_v$ and profit $p_v$, the size $s$ of the…

Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…

The Boone--Higman conjecture is that every recursively presented group with solvable word problem embeds in a finitely presented simple group. We discuss a brief history of this conjecture and work towards it. Along the way we describe some…

A finitely generated group is lacunary hyperbolic if one of its asymptotic cones is an $\mathbb{R}$-tree. In this article we give a necessary and sufficient condition on lacunary hyperbolic groups in order to be stable under free product by…

We study relationship among versions of the Knapsack Problem where variables take values in Z and the number of them is fixed. In particular, we construct a finitely presented group where the problem of solvability of exponential equations…

We prove that the compressed word problem in a group that is hyperbolic relative to a collection of free abelian subgroups is solvable in polynomial time.

Let $G$ be either a non-elementary (word) hyperbolic group or a large group (both in the sense of Gromov). In this paper we describe several approaches for constructing continuous families of periodic quotients of $G$ with various…

Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…

This paper deals with combinatorial aspects of finite covers of groups by cosets or subgroups. Let $a_1G_1,...,a_kG_k$ be left cosets in a group $G$ such that ${a_iG_i}_{i=1}^k$ covers each element of $G$ at least $m$ times but none of its…

Knapsack problems are among the most fundamental problems in optimization. In the Multiple Knapsack problem, we are given multiple knapsacks with different capacities and items with values and sizes. The task is to find a subset of items of…

Let $m$ and $k$ be integers such that $|m|, \, |k| >1$ and $\gcd (m,k)=1$. We show that all Baumslag-Solitar groups $BS(m,mk)$ are non-residually finite groups hyperbolic relative to residually finite subgroups. By a result of Osin (2007),…

Knapsack problem (KP) is a representative combinatorial optimization problem that aims to maximize the total profit by selecting a subset of items under given constraints on the total weights. In this study, we analyze a generalized version…