English
Related papers

Related papers: Knapsack in hyperbolic groups

200 papers

The notions of stable and Morse subgroups of finitely generated groups generalize the concept of a quasiconvex subgroup of a word-hyperbolic group. For a word-hyperbolic group $G$, Kapovich provided a partial algorithm which, on input a…

Group Theory · Mathematics 2020-04-21 Heejoung Kim

Benchmark instances for the unbounded knapsack problem are typically generated according to specific criteria within a given constant range $R$, and these instances can be referred to as the unbounded knapsack problem with bounded…

Data Structures and Algorithms · Computer Science 2024-03-19 Yang Yang

Fix a finite semigroup $S$ and let $a_1,\ldots,a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) asks whether $b$ can be generated by $a_1,\ldots,a_k$. If $S$ is a finite group, then there is a folklore…

Group Theory · Mathematics 2016-08-30 Andrei Bulatov , Marcin Kozik , Peter Mayr , Markus Steindl

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…

Optimization and Control · Mathematics 2021-06-29 Ulrich Pferschy , Joachim Schauer , Clemens Thielen

Given an undirected graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$, with vertex weights $(w(u))_{u\in\mathcal{V}}$, vertex values $(\alpha(u))_{u\in\mathcal{V}}$, a knapsack size $s$, and a target value $d$, the \vcknapsack problem is to…

Data Structures and Algorithms · Computer Science 2025-05-02 Palash Dey , Ashlesha Hota , Sudeshna Kolay , Sipra Singh

William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…

Group Theory · Mathematics 2007-10-10 A. M. W. Glass

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…

Discrete Mathematics · Computer Science 2021-03-16 Bence Bakos , Norbert Hegyvári , Máté Pálfy

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…

Group Theory · Mathematics 2008-03-12 Seymour Bachmuth

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…

Computational Complexity · Computer Science 2009-10-15 Chinmay Karande

Let $1\to (K,K_1)\to (G,N_G(K_1))\to(Q,Q_1)\to 1$ be a short exact sequence of pairs of finitely generated groups with $K$ strongly hyperbolic relative to proper subgroup $K_1$. Assuming that for all $g\in G$ there exists $k\in K$ such that…

Group Theory · Mathematics 2008-07-22 Abhijit Pal

The 1973 Boone-Higman conjecture predicts that every finitely generated group with solvable word problem embeds in a finitely presented simple group. In this paper, we show that hyperbolic groups satisfy this conjecture, that is, each…

Group Theory · Mathematics 2025-08-21 James Belk , Collin Bleak , Francesco Matucci , Matthew C. B. Zaremsky

We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly…

Data Structures and Algorithms · Computer Science 2020-08-03 Arturo Merino , Andreas Wiese

In this paper we describe finitely generated groups $H$ universally equivalent (with constants from $G$ in the language) to a given torsion-free relatively hyperbolic group $G$ with free abelian parabolics. It turns out that, as in the free…

Group Theory · Mathematics 2013-05-17 O. Kharlampovich , A. Myasnikov

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

Group Theory · Mathematics 2020-09-22 Vitaly Roman'kov

In this note, we provide a (super-exponential time) algorithm to solve the generalized conjugacy problem in relatively hyperbolic groups, given solvability of the generalized conjugacy problem in each of the parabolic subgroups.

Group Theory · Mathematics 2022-02-24 Chris Karpinski

This paper studies decision problems for semigroups that are word-hyperbolic in the sense of Duncan & Gilman. A fundamental investigation reveals that the natural definition of a `word-hyperbolic structure' has to be strengthened slightly…

Group Theory · Mathematics 2015-05-27 Alan J. Cain , Markus Pfeiffer

We say that a topological group $G$ is partially box $\kappa$-resolvable if there exist a dense subset $B$ of $G$ and a subset $A $ of $G$, $|A|=\kappa$ such that the subsets $\{ aB: a\in A\}$ are pairwise disjoint. If $G=AB$ then $G$ is…

General Topology · Mathematics 2015-11-04 Igor Protasov

Suppose that a finitely generated group $G$ is hyperbolic relative to a collection of subgroups $\mathbb{P}=\{P_1,\dots,P_m\}$. Let $H_1,H_2$ be subgroups of $G$ such that $H_1$ is relatively quasiconvex with respect to $\mathbb{P}$ and…

Group Theory · Mathematics 2016-09-19 Oleg Bogopolski , Kai-Uwe Bux

In 1951, Higman constructed a remarkable group $$H=\left\langle a,b,c,d \, \left| \, b^a = b^2, c^b = c^2, d^c = d^2, a^d = a^2 \right. \right\rangle$$ and used it to produce the first examples of infinite simple groups. By studying fixed…

Group Theory · Mathematics 2019-02-19 Owen Baker

Let N be a finitely generated normal subgroup of a Gromov hyperbolic group G. We establish criteria for N to have solvable conjugacy problem and be conjugacy separable in terms of the corresponding properties of G/N. We show that the…

Group Theory · Mathematics 2016-10-12 Armando Martino , Ashot Minasyan
‹ Prev 1 3 4 5 6 7 10 Next ›