Sequences of integers with three missing separations

DOI10.1016/J.EJC.2019.103056MaRDI QIDQ2297912zbMATH OpenOpenAlexWikidataFDO

Authors Daphne Der-Fen Liu, Grant Robinson

Publication date 20 February 2020

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1611.03940

zbMATH Keywords

D-sequencesequence density

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Special sequences and polynomials (11B83)

Abstract: Fix a set $D$ of positive integers. We study the maximum density $mu(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 $kappa(D)$, the parameter involved in the "lonely runner conjecture," is also investigated. Exact values of $kappa(D)$ and $mu(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.

Recommendations

• Sequences of integers with missing differences
• Sequences of integers avoiding 3-term arithmetic progressions
• Sequences of integers with missing quotients
• scientific article; zbMATH DE number 3264164
• Sequences containing no 3-term arithmetic progressions
• Some sequences of integers
• Three-term arithmetic progressions and sumsets
• On Sequences Containing at Most 3 Pairwise Coprime Integers

Cites work

• An Asymptotic Approach to the Channel Assignment Problem
• Circular chromatic number of distance graphs with distance sets of cardinality 3
• Circular chromatic numbers of a class of distance graphs
• Coloring of distance graphs with intervals as distance sets
• Coloring of integer distance graphs
• Colouring of distance graphs
• Colouring the real line
• Flows, view obstructions, and the lonely runner
• Fractional chromatic number and circular chromatic number for distance graphs with large clique size
• Fractional chromatic number of distance graphs generated by two-interval sets
• From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
• scientific article; zbMATH DE number 1275588 (Why is no real title available?)
• scientific article; zbMATH DE number 1735660 (Why is no real title available?)
• Integral distance graphs
• On the density of integral sets with missing differences from sets related to arithmetic progressions
• On the independence ratio of distance graphs
• Pattern periodic coloring of distance graphs
• Sequences of integers with missing differences
• Sets of integers with missing differences
• Sets of integers with missing differences
• Six lonely runners
• Star Extremal Circulant Graphs
• The channel assignment problem for mutually adjacent sites
• The lonely runner with seven runners
• View-obstruction problems in \(n\)-dimensional geometry
• View-obstruction problems. III
• Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen

Cited in

(11)

• A maximally separated sequence
• On optimal \(M\)-sets related to Motzkin's problem
• Maximal density of integral sets with missing differences and the kappa values
• On Motzkin's problem in the circle group
• Maximal density of sets with missing differences and various coloring parameters of distance graphs
• scientific article; zbMATH DE number 5115930 (Why is no real title available?)
• Sequences of integers avoiding 3-term arithmetic progressions
• Recognizing the three best of a sequence
• Maximal density and the kappa values for the families \(\{a,a+1,2a+1,n\}\) and \(\{a,a+1,2a+1,3a+1,n\}\)
• Max-norm Ramsey theory
• Packing density of sets with only two nonmixed gaps

This page was built for publication: Sequences of integers with three missing separations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297912)