Skip to content
Level A · Machine-checkable Hard Combinatorics P-sparse-ruler

Sparse Ruler

Wichmann's conjecture on optimal rulers. Every optimal ruler of sufficiently large length is a Wichmann ruler W(r, s) (up to reflection, i.e. reversing the segment list). Posed by Wichmann [Wi63].

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim. A Lean proof is checked against the statement below by the Lean kernel; a curator confirms before the problem counts as resolved.

Start working on it Submit a claim Follow
Cite
@misc{cairn-sparse-ruler,
  title        = {Sparse Ruler},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/sparse-ruler}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-09-28}
}

Also: CITATION.cff · Atom feed of results

Claims
0
Verified
0
Disputed
0
Refuted
0
On the literature board
0

Current state

No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.

The problem

The question

Wichmann's conjecture on optimal rulers. Every optimal ruler of sufficiently large length is a Wichmann ruler (up to reflection, i.e. reversing the segment list). Posed by Wichmann [Wi63]. The Wikipedia article records that no optimal ruler of length or is a Wichmann ruler, and that every other optimal length up to is attained by one; non-Wichmann optimal rulers also occur alongside Wichmann ones at lengths and .

A sparse ruler of length is a sequence of marks . A distance can be measured if there are , such that .

One question concerns the structure of optimal rulers. Wichmann [Wi63] gave a parametric family of sparse rulers and speculated that every sufficiently large optimal ruler is of his type. The Wikipedia article records that no optimal ruler of length or is a Wichmann ruler, and that every other optimal length up to is attained by one; non-Wichmann optimal rulers also occur alongside Wichmann ones at lengths and .

The asymptotic growth of the minimal number of marks of an optimal ruler of length — i.e. the limit of , conjectured to lie in — is the subject of FormalConjectures.ErdosProblems.«170» (there phrased via ), and is not restated here.

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.Wikipedia.SparseRuler.

theorem wichmann_conjecture :
    ∃ N : ℕ, ∀ g : List ℕ, IsOptimal g → N < g.sum →
      ∃ r s : ℕ, g = wichmannGaps r s ∨ g = (wichmannGaps r s).reverse

What counts as progress

  • A Lean proof of the pinned statement (or of its negation, for a yes/no question) — checked by the Lean kernel against the upstream statement; a curator confirms before the problem is marked resolved.
  • Partial results: special cases, weaker bounds, reductions — as verified claims.
  • Computations and numerical evidence with published code (reproducible).
  • Literature: the problem may have been solved or partly solved already. Report it as a literature claim.
  • A precise flaw in the formal statement (a misformalisation) — report it upstream too.

References

  • [Wi63] Wichmann, B. "A note on restricted difference bases." Journal of the London Mathematical Society 38 (1963): 465-466.
  • Wikipedia

Source and licence

Imported from Formal Conjectures (Wikipedia), commit e6d1743831c2. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.