Two divisibility problems on subset sums
Konstantinos Gaitanas

TL;DR
This paper investigates divisibility properties of subset sums in sets of integers, providing asymptotic results and structural insights for two related problems involving multiples and free-sequences.
Contribution
It offers new asymptotic bounds for the divisibility problem and refines existing results on the structure of sets with multiple-free subset sums.
Findings
Established asymptotic estimates for the first divisibility problem.
Improved bounds and structural characterizations for sets with multiple-free subset sums.
Abstract
We consider two problems regarding some divisibility properties of the subset sums of a set . At the beginning, we study the cardinality of which has the following property: For every there is a non empty set such that the sum of the elements of is a multiple of . Next, we turn our attention to another problem: If all subset sums of form a multiple free-sequence, what can we say about the structure of ? We give some asymptotics for the first problem and improve some already existing results for the second one.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Analytic Number Theory Research · graph theory and CDMA systems
