Carraher et al.'s odd-even density conjecture for three-element distance sets

Let D={1,j,k}D=\{1,j,k\}, where jj is odd, j3j\geqslant 3, and kk is even. Here μ(D)\mu(D) denotes the supremum of the densities of sequences of non-negative integers whose pairwise differences do not lie in DD.

Carraher et al.'s odd-even density conjecture. If k3jk\geqslant 3j, then

μ(D)=k2(k+j).\mu(D)=\frac{k}{2(k+j)}.

This conjecture was posed as part of a program determining the density of sequences avoiding prescribed separations. The supplied text does not state whether it has been proved or disproved.

Sources & referencesView supporting material

Primary source

Daphne Der-Fen Liu and Grant Robinson, “Sequences of Integers with Three Missing Separations”, arXiv:1611.03940 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.