Related papers: Knapsack and subset sum problems in nilpotent, pol…

A multiple knapsack constraint over a set of items is defined by a set of bins of arbitrary capacities, and a weight for each of the items. An assignment for the constraint is an allocation of subsets of items to the bins which adheres to…

We introduce and study a discrete multi-period extension of the classical knapsack problem, dubbed generalized incremental knapsack. In this setting, we are given a set of $n$ items, each associated with a non-negative weight, and $T$ time…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

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…

The principle of tannakian duality states that any neutral tannakian category is tensorially equivalent to the category Rep_k G of finite dimensional representations of some affine group scheme G and field k, and conversely. Originally…

Using a result of Kari and Ollinger, we prove that the torsion problem for elements of the Brin-Thompson group 2V is undecidable. As a result, we show that there does not exist an algorithm to determine whether an element of the rational…

The main goal of the paper is to present a general model theoretic framework to understand a result of Shalev on probabilistically finite nilpotent groups. We prove that a suitable group where the equation $[x_1,\ldots,x_k]=1$ holds on a…

We prove that any countable discrete and torsion free subgroup of a general linear group over an arbitrary field or a similar subgroup of an almost connected Lie group satisfies the integral algebraic K-theoretic (split) Novikov conjecture…

This work presents an empirical analysis of exact algorithms for the unbounded knapsack problem, which includes seven algorithms from the literature, two commercial solvers, and more than ten thousand instances. The terminating step-off, a…

Horocyclic products are a well-studied class of metric spaces that provide models for various solvable Lie groups, Baumslag-Solitar groups, and Lamplighter groups. Let $G$ act geometrically on a horocyclic product $X \bowtie Y$ of…

We investigate locally compact topological groups for which a generalized analogue of Heisenberg uncertainty inequality hold. In particular, it is shown that this inequality holds for $\mathbb{R}^n \times K$ (where $K$ is a separable…

We consider the hidden subgroup problem on the semi-direct product of cyclic groups $\Z_{N}\rtimes\Z_{p}$ with some restriction on $N$ and $p$. By using the homomorphic properties, we present a class of semi-direct product groups in which…

Following the example of Shor's algorithm for period-finding in the integers, we explore the hidden subgroup problem (HSP) for discrete infinite groups. On the hardness side, we show that HSP is NP-hard for the additive group of rational…

Let $G$ be a finite soluble group and $G^{(k)}$ the $k$th term of the derived series of $G$. We prove that $G^{(k)}$ is nilpotent if and only if $|ab|=|a||b|$ for any $\delta_k$-values $a,b\in G$ of coprime orders. In the course of the…

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

Let $1 \to N \to G \to G/N \to 1$ be a short exact sequence of countable discrete groups and let $B$ be any $G$-$C^*$-algebra. In this paper, we show that the strong Novikov conjecture with coefficients in $B$ holds for such a group $G$…

We consider the Bilevel Knapsack with Interdiction Constraints, an extension of the classic 0-1 knapsack problem formulated as a Stackelberg game with two agents, a leader and a follower, that choose items from a common set and hold their…

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…

Stallings folding theory is modified, using double coset representatives, and to applied to the study of subgroups of amalgamated products of finite rank free groups. As a first application the subgroup membership problem for such groups is…

We present a structural description of finite nilpotent groups of class at most $2$ using a specified number of subdirect and central products of $2$-generated such groups. As a corollary, we show that all of these groups are isomorphic to…