首页/论文/2006.03470

arXiv 2006.034702020-06-22math.GRcs.CC

On subset sum problem in branch groups

Andrey Nikolaev, Alexander Ushakov

备注：: v3: final version for journal of Groups, Complexity, Cryptology. arXiv admin note: text overlap with arXiv:1703.07406
发表信息：: journal of Groups, complexity, cryptology, Volume 12, Issue 1 (June 24, 2020) gcc:6541
DOI：: 10.46298/jgcc.2020.12.1.6541

英文摘要：

We consider a group-theoretic analogue of the classic subset sum problem. In this brief note, we show that the subset sum problem is NP-complete in the first Grigorchuk group. More generally, we show NP-hardness of that problem in weakly regular branch groups, which implies NP-completeness if the group is, in addition, contracting.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Subset sum problem in polycyclic groups

We consider a group-theoretic analogue of the classic subset sum problem. It is known that every virtually nilpotent group has polynomial time decidable subset sum problem. In this paper we use subgroup distortion to show that every polycyclic non-virtually-nilpotent group has NP-complete subset sum problem.

2017-03-21cs.CCmath.COmath.GR

Zero-sum subsets of decomposable sets in Abelian groups

A subset $D$ of an Abelian group is $decomposable$ if $\emptyset\ne D\subset D+D$. In the paper we give partial answer to an open problem asking whether every finite decomposable subset $D$ of an Abelian group contains a non-empty subset $Z\subset D$ with $\sum Z=0$. For every $n\in\mathbb N$ we present a decomposable subset $D$ of cardinality $|D|=n$ in the cyclic group of order $2^n-1$ such that $\sum D=0$, but $\sum T\ne 0$ for any proper non-empty subset $T\subset D$. On the other hand, we prove that every decomposable subset $D\subset\mathbb R$ of cardinality $|D|\le 7$ contains a non-emp…

2019-05-02math.COmath.GR

On sum-free subsets of abelian groups

In this paper we discuss some of the key properties of sum-free subsets of abelian groups. Our discussion has been designed with a broader readership in mind, and is hence not overly technical. We consider answers to questions like: how many sum-free subsets are there in a given abelian group $G$? what are its sum-free subsets of maximum cardinality? what is the maximum cardinality of these sum-free subsets? what does a typical sum-free subset of $G$ looks like? among others.

2023-03-27math.COmath.GR

自由群和曲面群上的唯一遍历分支子集流

Uniquely Ergodic Branching Subset Currents on Free and Surface Groups

Hunter College of CUNY（纽约市立大学亨特学院）

本文在自由群和曲面群上构造了具有真正分支支撑集的非有理子集流，证明其支撑集可为康托尔集，并揭示Choquet单纯形作为流锥体基的普适性，同时研究了有限模式复杂性与锥体维数的关系。

2026-10-06math.DSmath.GRmath.GT

分支作用与结构格

Branch actions and the structure lattice

Lund University（隆德大学）；University of the Basque Country UPV/EHU（巴斯克地区大学）

本文研究了分支群的结构格与树边界闭开子集布尔代数之间的同构关系，推广了Wilson关于第二类群的结论。

2025-04-19math.GR

Random sum-free subsets of Abelian groups

We characterize the structure of maximum-size sum-free subsets of a random subset of an Abelian group $G$. In particular, we determine the threshold $p_c \approx \sqrt{\log n / n}$ above which, with high probability as $|G| \to \infty$, each such subset is contained in a maximum-size sum-free subset of $G$, whenever $q$ divides $|G|$ for some (fixed) prime $q$ with $q \equiv 2 \pmod 3$. Moreover, in the special case $G = \ZZ_{2n}$, we determine a sharp threshold for the above property. The proof uses recent 'transference' theorems of Conlon and Gowers, together with stability theorems for sum-…

2012-11-16math.COmath.GRmath.PR

更多相关论文收起更多论文

The subset sum problem for finite abelian groups

Let G be a finite abelian group. For g in G and i an integer we define N(i,g) to be the number of subsets of G of size i which sum up to g. We will give a short proof, using character theory, of a formula for these N(i,g) due to Li and Wan. We also give a formula for N(i,g)*, the number of subsets of G not containing 0 of size i which sum up to g. This generalizes another result of Wan.

2011-12-29math.COmath.GRmath.NT

The sharp threshold for maximum-size sum-free subsets in even-order abelian groups

We study sum-free sets in sparse random subsets of even order abelian groups. In particular, we determine the sharp threshold for the following property: the largest such set is contained in some maximum-size sum-free subset of the group. This theorem extends recent work of Balogh, Morris and Samotij, who resolved the case G = Z_{2n}, and who obtained a weaker threshold (up to a constant factor) in general.

2014-07-18math.COmath.GRmath.PR

Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups

It is shown that the knapsack problem (introduced by Myasnikov, Nikolaev, and Ushakov) is undecidable in a direct product of sufficiently many copies of the discrete Heisenberg group (which is nilpotent of class 2). Moreover, for the discrete Heisenberg group itself, the knapsack problem is decidable. Hence, decidability of the knapsack problem is not preserved under direct products. It is also shown that for every co-context-free group, the knapsack problem is decidable. For the subset sum problem (also introduced by Myasnikov, Nikolaev, and Ushakov) we show that it belongs to the class NL (n…

2015-07-18cs.FLmath.GR

Subset sums in abelian groups

Denoting by Sigma(S) the set of subset sums of a subset S of a finite abelian group G, we prove that |Sigma(S)| >= |S|(|S|+2)/4-1 whenever S is symmetric, |G| is odd and Sigma(S) is aperiodic. Up to an additive constant of 2 this result is best possible, and we obtain the stronger (exact best possible) bound in almost all cases. We prove similar results in the case |G| is even. Our proof requires us to extend a theorem of Olson on the number of subset sums of anti-symmetric subsets S from the case of Z_p to the case of a general finite abelian group. To do so, we adapt Olson's method using a g…

2011-12-08math.COmath.GRmath.NT

有限阿贝尔群中零和三元组的最小不可分割零和子集

The least non-partitionable zero-sum subset for zero-sum triples in finite abelian groups

本文研究了有限阿贝尔群中不存在零和三元组分割的最小零和子集的大小，完全分类了μ(G)为无穷或6的情况，并推广到循环群。

2026-06-15math.COmath.GR

Sum-free Sets of Integers with a Forbidden Sum

A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We study sum-free subsets of the set of integers $[n]=\{1,\ldots,n\}$ for which the integer $2n+1$ cannot be represented as a sum of their elements. We prove a bound of $O(2^{n/3})$ on the number of these sets, which matches, up to a multiplicative constant, the lower bound obtained by considering all subsets of $B_n = \{ \lceil \frac{2}{3}(n+1) \rceil, \ldots, n \}$. A main ingredient in the proof is a stability theorem saying that if a subset of $[n]$ of size close to $|B_n|$ contains only a few subsets that co…

2018-12-22math.COmath.GRmath.NT