A proof of Coleman's conjecture (Q882109)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5156485
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A proof of Coleman's conjecture |
scientific article; zbMATH DE number 5156485 |
Statements
A proof of Coleman's conjecture (English)
0 references
23 May 2007
0 references
Let \(K\) be a convex lattice polygon in the plane with \(v\) vertices, \(g\) interior lattice points, and \(b\) boundary lattice points. \textit{D. B. Coleman} [Math. Mag. 51, 49--54 (1978; Zbl 0396.90107)] conjectured that if \(g\geq 1\) then \(b\leq 2g-v+10\). This conjecture is proved in the paper under review, and the cases of equality are characterized. Certain stronger inequalities are also derived for large \(v\).
0 references
lattice point
0 references
convex lattice polygon
0 references
lattice point enumerator
0 references
Coleman's conjecture
0 references
0.7283417582511902
0 references
0.7267428636550903
0 references
0.7236855626106262
0 references
0.7197533249855042
0 references
