Related papers: Subset sum problem in polycyclic groups
In this paper, a polynomial time algorithm for finding the set of all cyclic subsets in a graph is presented. The concept of cyclic subsets has already been introduced in an earlier paper. The algorithm finds cyclic subsets in a graph G by…
We consider the SUBSET SUM problem and its important variants in this paper. In the SUBSET SUM problem, a (multi-)set $X$ of $n$ positive numbers and a target number $t$ are given, and the task is to find a subset of $X$ with the maximal…
We classify all (saturated) fusion systems on bicyclic 2-groups. Here, a bicyclic group is a product of two cyclic subgroups. This extends previous work on fusion systems on metacyclic 2-groups (see [Craven-Glesser, 2012] and [Sambale,…
This contains a new version of the so-called non-commutative Gauss algorithm for polycyclic groups. Its results allow to read off the order and the index of a subgroup in an (possibly infinite) polycyclic group.
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…
We consider the problem of evaluating certain exponential sums. These sums take the form $\sum_{x_1,...,x_n \in Z_N} e^{f(x_1,...,x_n) {2 \pi i / N}} $, where each x_i is summed over a ring Z_N, and f(x_1,...,x_n) is a multivariate…
We investigate the question whether Subset Sum can be solved by a polynomial-time algorithm with access to a certificate of length poly(k) where k is the maximal number of bits in an input number. In other words, can it be solved using only…
We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight line programs defined…
We consider the problem of constructing matched groups such that the resulting groups are statistically similar with respect to their average values for multiple covariates. This group-matching problem arises in many cases, including…
We introduce the abstract concept of supernilpotence in loop theory, and relate it to existing concepts, namely, central nilpotence and nilpotence of the multiplication group. We prove that the class of supernilpotence is greater or equal…
A group in which all cyclic subgroups are 2-subnormal is called a 2-Baer group. The topic of this paper are generalized 2-Baer groups, i.e. groups in which the non-2-subnormal cyclic subgroups generate a proper subgroup of the group. If…
We study the complexity of graph problems on graphs defined on groups, especially power graphs. We observe that an isomorphism invariant problem, such as Hamiltonian Path, Partition into Cliques, Feedback Vertex Set, Subgraph Isomorphism,…
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…
The complexity class NP of decision problems that can be solved nondeterministically in polynomial time is of great theoretical and practical importance where the notion of polynomial-time reductions between NP-problems is a key concept for…
Subset sum is a very old and fundamental problem in theoretical computer science. In this problem, $n$ items with weights $w_1, w_2, w_3, \ldots, w_n$ are given as input and the goal is to find out if there is a subset of them whose weights…
We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.
In this paper we formulate and study the problem of representing groups on graphs. We show that with respect to polynomial time turing reducibility, both abelian and solvable group representability are all equivalent to graph isomorphism,…
A numerical semigroup is called cyclotomic if its corresponding numerical semigroup polynomial $P_S(x)=(1-x)\sum_{s\in S}x^s$ is expressable as the product of cyclotomic polynomials. Ciolan, Garc\'ia-S\'anchez, and Moree conjectured that…
The reviewed paper describes an analog device that empirically solves small instances of the NP-complete Subset Sum Problem (SSP). The authors claim that this device can solve the SSP in polynomial time using polynomial space, in principle,…
A subgroup $A$ of a group~$G$ is said to be {\sl NS-supplemented} in $G$, if there exists a subgroup~$B$ of $G$ such that $G=AB$ and whenever $X$~is a normal subgroup of~$A$ and $p\in \pi(B)$, there exists a Sylow $p$-subgroup~$B_p$ of~$B$…