Related papers: Knapsack problems in products of groups
The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…
We obtain optimal lower and upper bounds for the (additive) integrality gaps of integer knapsack problems. In a randomised setting, we show that the integrality gap of a "typical" knapsack problem is drastically smaller than the integrality…
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…
We consider chance-constrained binary knapsack problems, where the weights of items are independent random variables with the means and standard deviations known. The chance constraint can be reformulated as a second-order cone constraint…
We study local consequence relations in modal extensions of product logic over Kripke models with either valued (fuzzy) or crisp accessibility relations. In both settings, we consider semantics over the full class of product algebras as…
A homomorphism from a completely metrizable topological group into a free product of groups whose image is not contained in a factor of the free product is shown to be continuous with respect to the discrete topology on the range. In…
We give a simplified approach to the cubulation of small-cancellation quotients of free products of cubulated groups. We construct fundamental groups of compact nonpositively curved cube complexes that do not virtually split.
The complementarity knapsack problem (CKP) is a knapsack problem with real-valued variables and complementarity conditions between pairs of its variables. We extend the polyhedral studies of De Farias et al. for CKP, by proposing three new…
In this note, we show that the satisfiability of equations and inequations with recognisable constraints is decidable in groups that are virtually direct products of finitely many hyperbolic groups.
We prove a long exact sequence in KK-theory for both full and reduced amalgamated free products in the presence of conditional expectations. In the course of the proof, we established the KK-equivalence between the full amalgamated free…
We study the $K$-item knapsack problem (i.e., $1.5$-dimensional KP), which is a generalization of the famous 0-1 knapsack problem (i.e., $1$-dimensional KP) in which an upper bound $K$ is imposed on the number of items selected. This…
In this paper, we prove a general hardness amplification scheme for optimization problems based on the technique of direct products. We say that an optimization problem $\Pi$ is direct product feasible if it is possible to efficiently…
Organisations rely upon group formation to solve complex tasks, and groups often adapt to the demands of the task they face by changing their composition periodically. Previous research comes to ambiguous results regarding the effects of…
Given two convex polytopes, the join, the cartesian product and the direct sum of them are well understood. In this paper we extend these three kinds of products to abstract polytopes and introduce a new product, called the topological…
Robust optimization methods have shown practical advantages in a wide range of decision-making applications under uncertainty. Recently, their efficacy has been extended to multi-period settings. Current approaches model uncertainty either…
We develop a theory of direct and central products of partial groups and localities.
In this paper we describe the amalgamated free product of two hyperfinite von Neumann algebras over a finite dimensional subalgebra. In general the free product is a finite direct sum of interpolated free group factors and a hyperfinite von…
The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…
Howie and Duncan observed that a word in a free product with length at least two and which is not a proper power can be decomposed as a product of two cyclic subwords each of which is uniquely positioned. Using this property, they proved…
We study the seeded domino problem, the recurring domino problem and the $k$-SAT problem on finitely generated groups. These problems are generalization of their original versions on $\mathbb{Z}^2$ that were shown to be undecidable using…