English
Related papers

Related papers: Knapsack in hyperbolic groups

200 papers

We give a new, effective proof of the separability of cubically convex-cocompact subgroups of special groups. As a consequence, we show that if $G$ is a virtually compact special hyperbolic group, and $Q\leq G$ is a $K$-quasiconvex…

Group Theory · Mathematics 2016-08-03 Mark F. Hagen , Priyam Patel

In this paper, we provide new criteria for the solvability and supersolvability of a finite group based on its number of cyclic subgroups. A finite group G is called n-cyclic if it contains n cyclic subgroups. This paper also partially…

Group Theory · Mathematics 2026-04-28 Angsuman Das , Khyati Sharma

Let $G$ be an acylindrically hyperbolic group and $E$ an exponential equation over $G$. We show that if $E$ is solvable in $G$, then there exists a solution whose components, corresponding to loxodromic elements, can be linearly estimated…

Group Theory · Mathematics 2021-06-23 Agnieszka Bier , Oleg Bogopolski

We give a deterministic, polynomial-time algorithm for approximately counting the number of {0,1}-solutions to any instance of the knapsack problem. On an instance of length n with total weight W and accuracy parameter eps, our algorithm…

Data Structures and Algorithms · Computer Science 2010-08-20 Parikshit Gopalan , Adam Klivans , Raghu Meka

Previously the author has demonstrated that a representative polynomial search partition is required to solve a NP-complete problem in deterministic polynomial time. It has also been demonstrated that finding such a partition can only be…

Computational Complexity · Computer Science 2008-09-07 Jerrald Meek

We generalize the classical Post correspondence problem ($\mathbf{PCP}_n$) and its non-homogeneous variation ($\mathbf{GPCP}_n$) to non-commutative groups and study the computational complexity of these new problems. We observe that…

Group Theory · Mathematics 2015-08-12 Alexei Myasnikov , Andrey Nikolaev , Alexander Ushakov

Let $G$ be a simple algebraic group over an algebraically closed field $k$ and let $C_1, \ldots, C_t$ be non-central conjugacy classes in $G$. In this paper, we consider the problem of determining whether there exist $g_i \in C_i$ such that…

Group Theory · Mathematics 2020-04-13 Timothy C. Burness , Spencer Gerhardt , Robert M. Guralnick

The 2024 edition of the CG:SHOP Challenge focused on the knapsack polygonal packing problem. Each instance consists of a convex polygon known as the container and a multiset of items, where each item is a simple polygon with an associated…

Computational Geometry · Computer Science 2026-01-16 Guilherme D. da Fonseca , Yan Gerard

Given a finite abelian group $G$ and $t\in \mathbb{N}$, there are two natural types of subsets of the Cartesian power $G^t$; namely, Cartesian powers $S^t$ where $S$ is a subset of $G$, and (cosets of) subgroups $H$ of $G^t$. A basic…

Group Theory · Mathematics 2025-07-01 Pim Spelier

We prove that every finitely presented self-similar group embeds in a finitely presented simple group. This establishes that every group embedding in a finitely presented self-similar group satisfies the Boone-Higman conjecture. The simple…

Group Theory · Mathematics 2025-01-22 Matthew C. B. Zaremsky

A result of Gersten states that if $G$ is a hyperbolic group with integral cohomological dimension $\mathsf{cd}_{\mathbb{Z}}(G)=2$ then every finitely presented subgroup is hyperbolic. We generalize this result for the rational case…

Group Theory · Mathematics 2020-12-21 Shivam Arora , Eduardo Martínez-Pedroza

The isometry group of a compact n-dimensional hyperbolic manifold is known to be finite. We show that for every n > 2, every finite group is realized as the full isometry group of some compact hyperbolic n-manifold. The cases n = 2 and n =…

Group Theory · Mathematics 2009-11-10 M. Belolipetsky , A. Lubotzky

In this paper we study satisfiability of random equations in an infinite finitely generated nilpotent group G. We show that the set SAT(G,k) of all equations in k > 1 variables over G which are satisfiable in G has an intermediate…

Group Theory · Mathematics 2011-06-10 Robert Gilman , Alexei Myasnikov , Vitalii Romankov

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

Discrete Mathematics · Computer Science 2023-09-12 Ruiwen Dong

We are looking for the smallest integer k>1 providing the following characterization of the solvable radical R(G) of any finite group G: R(G) coincides with the collection of all g such that for any k elements a_1,a_2,...,a_k the subgroup…

Group Theory · Mathematics 2008-01-03 Nikolai Gordeev , Fritz Grunewald , Boris Kunyavskii , Eugene Plotkin

This arXived paper has two independant parts, that are improved and corrected versions of different parts of a single paper once named "On equations in relatively hyperbolic groups". The first part is entitled "Existential questions in…

Group Theory · Mathematics 2020-07-20 Francois Dahmani

In this paper, we study the stochastic unbounded min-knapsack problem ($\textbf{Min-SUKP}$). The ordinary unbounded min-knapsack problem states that: There are $n$ types of items, and there is an infinite number of items of each type. The…

Data Structures and Algorithms · Computer Science 2019-04-16 Zhihao Jiang , Haoyu Zhao

We describe a procedure to deform cubulations of hyperbolic groups by "bending hyperplanes". Our construction is inspired by related constructions like Thurston's Mickey Mouse example, walls in fibred hyperbolic $3$-manifolds and…

Geometric Topology · Mathematics 2026-03-25 Elia Fioravanti , Mark Hagen

Given two $k$-graphs $H$ and $F$, a perfect $F$-packing in $H$ is a collection of vertex-disjoint copies of $F$ in $H$ which together cover all the vertices in $H$. In the case when $F$ is a single edge, a perfect $F$-packing is simply a…

Combinatorics · Mathematics 2016-09-21 Jie Han , Andrew Treglown

We show that the set $SA(G)$ of equivalence classes of synchronously automatic structures on a geometrically finite hyperbolic group $G$ is dense in the product of the sets $SA(P)$ over all maximal parabolic subgroups $P$. The set $BSA(G)$…

Group Theory · Mathematics 2009-10-28 Walter D. Neumann , Michael Shapiro
‹ Prev 1 8 9 10 Next ›