Sequences of Integers with Three Missing Separations
Abstract
Fix a set D of positive integers. We study the maximum density μ(D) of sequences of integers in which the separation between any two terms does not fall in D. The D-sets considered in this article are of the form \1,j,k\. The closely related function (D), the parameter involved in the "lonely runner conjecture," is also investigated. Exact values of (D) and μ(D) are found for some families of D=\1,j,k\. We prove that the boundary conditions in two earlier results of Haralambis are sharp. Consequently, our results declaim two conjectures posted recently, and extend some results by Gupta.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.