A sumset version of a conjecture of Pilz
J\'anos Nagy, P\'eter P\'al Pach

TL;DR
This paper explores a sumset variant of Pilz's conjecture, demonstrating that the sumset of scaled sets contains at least n values with odd multiplicity, extending the original problem's scope.
Contribution
It introduces a sumset version of Pilz's conjecture and proves that at least n values appear an odd number of times in this sumset.
Findings
Sumset contains at least n values with odd multiplicity
Extends Pilz's conjecture to sumsets
Provides a new perspective on additive properties of scaled sets
Abstract
Pilz's conjecture states that for any finite set of positive integers and positive integer in the union of the sets (considered as a multiset) at least values appear an odd number of times. In this short note we consider a variant of this problem. Namely, we show that in the sumset (considered as a multiset) at least values appear an odd number of times.
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
Topicsgraph theory and CDMA systems
