Mathematics Program Presents
Counting Lattice Points in Triangles and the "Fibonacci Staircase"
Thursday, October 10, 2013
Hegeman 204
A lecture byDaniel Cristofaro-Gardiner
The Institute for Advanced Study
The "Ehrhart polynomial" is an important tool for counting lattice points in triangles and other polygons. An Ehrhart polynomial has a "period", and the relationship between the coordinates of the vertices of a polygon and the period of its Ehrhart polynomial can be quite mysterious. Daniel Cristofaro-Gardiner will present recent joint work with Aaron Kleinman relating the periods of the Ehrhart polynomials of some simple triangles with recursive sequences like the Fibonacci numbers and the Pell numbers. Interestingly, this is linked to a curious staircase arising in a special geometry called "symplectic" geometry.
For more information, call 845-758-6822, or e-mail [email protected].
Location: Hegeman 204