Skip to main content
4 events
when toggle format what by license comment
Jun 30, 2017 at 22:26 vote accept Greg Kuperberg
Jun 13, 2017 at 6:19 answer added Noah Stephens-Davidowitz timeline score: 4
Jan 21, 2013 at 17:44 comment added Greg Kuperberg Here is a primitive bound for lattice polytopes (not necessarily centrally symmetric) that is already interesting. It looks like a lattice polytope can be triangulated by lattice simplices with no internal vertices. This yields $N \le (n+1)!(\text{Vol} K)$. This bound is apparently refined by a bound on Ehrhart coefficients due to Betke and McMullen. This estimate and the Betke-McMullen bound might already be what I'm looking for. I will leave the question open for now in case there are further ideas.
Jan 21, 2013 at 7:17 history asked Greg Kuperberg CC BY-SA 3.0