Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings
N\'ora Frankl, Andrey Kupavskii, Arsenii Sagdeev

TL;DR
This paper confirms a conjecture by Schmidt and Tuller regarding optimal packings and coverings of integers with three-point sets, and connects it to broader combinatorial problems.
Contribution
It proves the Schmidt and Tuller conjecture on integer packings and coverings and explores its implications in combinatorics.
Findings
Conjecture by Schmidt and Tuller confirmed.
Connections established with other combinatorial problems.
Provides a comprehensive solution to a longstanding problem.
Abstract
In 2008, Schmidt and Tuller stated a conjecture concerning optimal packing and covering of integers by translates of a given three-point set. In this note, we confirm their conjecture and relate it to several other problems in combinatorics.
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 · Advanced Graph Theory Research · graph theory and CDMA systems
