The maximal-volume conjecture for clean lattice tetrahedra
The maximal-volume conjecture for clean lattice tetrahedra
Let denote the family of clean lattice tetrahedra in with interior lattice points, and let denote the normalized volume of . Maximal-volume conjecture. If , then
This conjecture proposes a linear upper bound for the volume of clean lattice tetrahedra in terms of their number of interior lattice points. The bound is motivated by computations; the source does not report a proof or a counterexample.
Sources & referencesView supporting material
Primary source
Han Duong, “Minimal volume k-point lattice d-simplices”, arXiv:0804.2910 (2008).
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
Sign in to submit a solution.
No solutions have been posted yet.