2 problems

Finite verification conjecture. Checking condition (3) can be reduced to a finite number of verifications. In particular, there exists a finite procedure for determining whether…

Let $i\in\mathbb{Z}_{\geq 2}$ be the number of interior lattice points of a half-integral polygon, and require the polygon to have at least $2$ boundary lattice points. An Ehrhart…