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

About 1 year old · traced to

For k∈N∖{1}k\in\mathbb{N}\setminus\{1\}, let L≤kL_{\leq k} be the Lüroth set with digits at most kk, and let L≥kL_{\geq k} be the Lüroth set with digits at least kk. Write A+B={a+b:a∈A,b∈B}A+B=\{a+b:a\in A,b\in B\} and A≡Rmod  1A\equiv\mathbb{R}\mod 1 when A+Z=RA+\mathbb{Z}=\mathbb{R}. The conjecture. For every k∈N∖{1}k\in\mathbb{N}\setminus\{1\},

L≤k+L≥k≡Rmod  1.L_{\leq k}+L_{\geq k}\equiv\mathbb{R}\mod 1.

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

References

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.