A proof of Coleman's conjecture (Q882109): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.09.033 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2162387519 / rank | |||
Normal rank | |||
Revision as of 02:20, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A proof of Coleman's conjecture |
scientific article |
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
