Related papers: On subset sum problem in branch groups
We study the Prishchepov groups $P(r,n,k,s,q)$, a unifying family of cyclically presented groups that encompasses many classical cases. For $n$ coprime to $6$, we prove a conjecture essentially characterizing when these groups are perfect:…
Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability.…
Let $G$ be a finite group and $p^k$ be a prime power dividing $|G|$. A subgroup $H$ of $G$ is called to be $\mathcal{M}$-supplemented in $G$ if there exists a subgroup $K$ of $G$ such that $G=HK$ and $H_iK<G$ for every maximal subgroup…
The aim of this paper is to describe the structure of the finitely generated subgroups of a family of branch groups, which includes the first Grigorchuk group and the Gupta-Sidki 3-group. This description is made via the notion of block…
In this letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This…
In this paper, we investigate the computational complexity of the knapsack problem and subset sum problem for the following tropical algebraic structures. We consider the semigroup of square matrices of size $k \times k$ with non-negative…
In this paper we prove that the Conjugacy Problem in the Grigorchuk group $\Gamma$ has polynomial time complexity.
The "Subset Sum problem" is a very well-known NP-complete problem. In this work, a top-k variation of the "Subset Sum problem" is considered. This problem has wide application in recommendation systems, where instead of k best objects the k…
Groups, in which every subgroup containing some fixed primary cyclic subgroup has a complement, are investigated.
We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…
This paper investigates the computational complexity of deciding whether the vertices of a graph can be partitioned into a disjoint union of cliques and a triangle-free subgraph. This problem is known to be $\NP$-complete on arbitrary…
This article presents the construction of finitely generated branch groups with uncountably many maximal subgroups using embedding techniques. This addresses a question posed by Grigorchuk.
The regular number of a graph G denoted by reg(G) is the minimum number of subsets into which the edge set of G can be partitioned so that the subgraph induced by each subset is regular. In this work we answer to the problem posed as an…
We prove that the word problem of the Brin-Thompson group nV over a finite generating set is coNP-complete for every n \ge 2. It is known that the groups nV are an infinite family of infinite, finitely presented, simple groups. We also…
We study completions of the group algebra of a finitely generated group and relate nuclearity of such a completion to growth properties of the group. This extends previous work of Jolissaint on nuclearity of rapidly decreasing functions on…
We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…
We give the analysis of the computational complexity of coalition structure generation over graphs. Given an undirected graph G = (N,E) and a valuation function v : P(N) \to R over the subsets of nodes, the problem is to find a partition of…
We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…
Recently knapsack problems have been generalized from the integers to arbitrary finitely generated groups. The knapsack problem for a finitely generated group $G$ is the following decision problem: given a tuple $(g, g_1, \ldots, g_k)$ of…
Let $\mathrm{WP}_G$ denote the word problem in a finitely generated group $G$. We consider the complexity of $\mathrm{WP}_G$ with respect to standard deterministic Turing machines. Let $\mathrm{DTIME}_k(t(n))$ be the complexity class of…