Year: 2021
Type: preprint
Abstract: We prove that there is a matching between 2 intervals of positive integers of the same even length, with corresponding pairs coprime, provided the intervals are in $[n]$ and their lengths are $>c(\log n)^2$, for a positive constant $c$. This improves on a recent result of Bohman and Peng. As in their paper, the result has an application to the lonely runner conjecture.
Source: arXiv (Cornell University)
Author: Pomerance, Carl
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4306879823