combinatorics / Combinatorial geometry

Rectangles versus Isosceles Triangles in Lattice Sets

Can a finite set of lattice points determine many rectangles but few isosceles triangles? Both parts of the governing question have negative answers, quantified by explicit blowup rates, and the resulting configurations give obstructions in the Mizohata-Takeuchi circle of problems.

15Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

combinatoricsJun 29, 2026Significance 15/100Registry: unreviewed

Rectangles versus Isosceles Triangles in Lattice Sets

Prior state unknowndisproved

Can a finite set of lattice points determine many rectangles but few isosceles triangles? Both parts of the governing question have negative answers, quantified by explicit blowup rates, and the resulting configurations give obstructions in the Mizohata-Takeuchi circle of problems.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Can a finite set of lattice points determine many rectangles but few isosceles triangles? Both parts of the governing question have negative answers, quantified by explicit blowup rates, and the resulting configurations give obstructions in the Mizohata-Takeuchi circle of problems.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.