Periodicity of complementing multisets
Zeljka Ljujic

TL;DR
This paper proves that for certain multisets of integers, the complementing multiset must be periodic and provides an upper bound on its smallest period based on the multiset's diameter and weight sum.
Contribution
It establishes a Biro-type upper bound on the period of complementing multisets, extending previous results with explicit bounds depending on multiset parameters.
Findings
Complementing multisets are necessarily periodic.
The smallest period's logarithm is bounded by a function of the multiset's diameter.
The bound depends on the multiset's diameter and weight sum, with explicit constants.
Abstract
Let be a finite multiset of integers. If be a multiset such that and are -complementing multisets of integers, then is periodic. We obtain the Biro-type upper bound for the smallest such period of : Let . We assume that and that , where is any constant such that . Then is periodic with period \[\log k\leq (\textrm{diam}(A)+1)^{1/3+\epsilon}. \]
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 applications
