Sparse Ruler Conjecture

combinatorics number-theory graph-theory

I proved it.
In short, for values over 120000, just add an extra mark or two at the end of a Wichmann construction to get an excess 0 or 1 ruler for all lengths.
For values under 12000, solutions for all tricky lengths like 1792 were found with a 3 month computer search.

See Hitting all the Marks for more details.

Related

Prove that if $\operatorname{rank}A=n$, then $\operatorname{rank}AB=\operatorname{rank}B$
How to make sense of complex coordinates on manifolds?
Galois representations and normal bases
Does Hodge-star commute with metric connections?
Books for Numerical linear algebra
Prove $(1-a)(1-b)(1-c)(1-d)\geq abcd$ if $a^2+b^2+c^2+d^2=1$
How to find intersection of two lines in 3D?
Measure zero of the graph of a continuous function
Prove that polynomial of degree $4$ with real roots cannot have $\pm 1$ as coefficients (IITJEE)
Partition of plane into parabolas
What are some rigorous definitions for sine and cosine?
Can two different roots of an irreducible polynomial generate the same extension?