The conjecture that matched upper- and lower-bounded Lüroth sets cover modulo 1

For kN{1}k\in\mathbb{N}\setminus\{1\}, let LkL_{\leq k} be the Lüroth set with digits at most kk, and let LkL_{\geq k} be the Lüroth set with digits at least kk. Write A+B={a+b:aA,bB}A+B=\{a+b:a\in A,b\in B\} and ARmod1A\equiv\mathbb{R}\mod 1 when A+Z=RA+\mathbb{Z}=\mathbb{R}. The conjecture. For every kN{1}k\in\mathbb{N}\setminus\{1\},

Lk+LkRmod1.L_{\leq k}+L_{\geq k}\equiv\mathbb{R}\mod 1.

This would strengthen Theorem 4, which proves the same assertion with Lk+2L_{\leq k+2} in place of LkL_{\leq k}. The conjecture is motivated by the observation that the diameter of Lk+LkL_{\leq k}+L_{\geq k} equals 11, but the source leaves its truth open.

Sources & referencesView supporting material

Primary source

Maiken Gravgaard and Ying Wai Lee, “Decomposition of real numbers into sums of Lüroth sets”, arXiv:2506.12513 (2026).

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.