A Counterexample to Corzatt's Four-Direction Conjecture

Corzatt conjectured that if the lattice points of a convex body in the plane can be covered by n lines, then they can be covered by n lines having at most four different directions. We show that this is false. The 35 lattice points of the hexagon with vertices (0, 0), (1, 0), (8, 2), (8, 3), (6, 7) and (5, 8) are covered by the eight lines y = 2, y = 3, x − y = 0, x − y = 2, x + y = 11, 2x − y = 2, 2x − y = 3 and 3x − y = 11, which have five directions. No seven lines cover these points and no other eight lines do, so every cover by eight lines needs five directions; with four directions, nine lines are needed. The proof is a finite computation that three elementary lemmas make small, and a standalone exact verifier repeats it in under half a minute. The example was found by growing lattice polygons one point at a time from a minimal polygon of lattice width eight, while tracking how a cover of the final set restricts to the starting polygon. The decisive step was to follow restrictions that cannot be shortened but are not optimal. A second counterexample, inequivalent to the first under lattice-preserving affine maps, shares seven of its eight lines.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-12
DOI
https://doi.org/10.5281/zenodo.24177844
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Counterexample to Corzatt's Four-Direction Conjecture

John Seamons
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

A Counterexample to Corzatt's Four-Direction Conjecture

John Seamons
preprint en

Abstract

Corzatt conjectured that if the lattice points of a convex body in the plane can be covered by n lines, then they can be covered by n lines having at most four different directions. We show that this is false. The 35 lattice points of the hexagon with vertices (0, 0), (1, 0), (8, 2), (8, 3), (6, 7) and (5, 8) are covered by the eight lines y = 2, y = 3, x − y = 0, x − y = 2, x + y = 11, 2x − y = 2, 2x − y = 3 and 3x − y = 11, which have five directions. No seven lines cover these points and no other eight lines do, so every cover by eight lines needs five directions; with four directions, nine lines are needed. The proof is a finite computation that three elementary lemmas make small, and a standalone exact verifier repeats it in under half a minute. The example was found by growing lattice polygons one point at a time from a minimal polygon of lattice width eight, while tracking how a cover of the final set restricts to the starting polygon. The decisive step was to follow restrictions that cannot be shortened but are not optimal. A second counterexample, inequivalent to the first under lattice-preserving affine maps, shares seven of its eight lines.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon