Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.18805 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Móricz and Nagy introduced the problem of maximizing the number of $r$-element subsets with rational sums in an $n$-element set of irrational numbers, and showed that it is equivalent to an extremal zero-sum problem. They determined the exact maximum in several cases. For the remaining range, they presented an explicit construction of an $n$-element set of irrational numbers containing exactly $m\binom{n-m}{r-1}$ such subsets, where $m=\lfloor n/r\rfloor$. They conjectured that this construction is always optimal for any $1<r<n$. In this paper, we confirm that conjecture. Our proof combines an order-theoretic antichain argument for zero-sum subsets with a sharp maximization of the resulting binomial expressions. As a consequence, we determine exactly the maximum number of $r$-term zero-sum subsequences in sequences of $n$ nonzero integers.