math.CO — Combinatorics
An Arbor Polytope with Nonreal Ehrhart Roots
We construct a singleton-labeled arbor on 243 vertices whose Ehrhart polynomial has a nonreal root. This disproves the conjecture that the Ehrhart roots of every arbor polytope are real and lie in . The polynomial factors as , where is an explicit quintic. We derive this identity by counting lattice points for every nonnegative integer dilation, using three moments of subtree deficits. A negative value of at gives an exact nonreal-root certificate. The lattice-count identity and the resulting counterexample have been formalized and checked in Lean.
Primarily AI-generated textHuman understanding: no partsEhrhart polynomialsLean formalizationarbor polytopescounterexamplereal-rootedness