Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2006. / Includes bibliographical references (p. 89-91). / In this thesis, we study the Ehrhart polynomials of different polytopes. In the 1960's Eugene Ehrhart discovered that for any rational d-polytope P, the number of lattice points, i(P,m), in the mth dilated polytope mP is always a quasi-polynomial of degree d in m, whose period divides the least common multiple of the denominators of the coordinates of the vertices of P. In particular, if P is an integral polytope, i(P, m) is a polynomial. Thus, we call i(P, m) the Ehrhart (quasi-)polynomial of P. In the first part of my thesis, motivated by a conjecture given by De Loera, which gives a simple formula of the Ehrhart polynomial of an integral cyclic polytope, we define a more general family of polytopes, lattice-face polytopes, and show that these polytopes have the same simple form of Ehrhart polynomials. we also give a conjecture which connects our theorem to a well-known fact that the constant term of the Ehrhart polynomial of an integral polytope is 1. In the second part (joint work with Brian Osserman), we use Mochizuki's work in algebraic geometry to obtain identities for the number of lattice points in different polytopes. We also prove that Mochizuki's objects are counted by polynomials in the characteristic of the base field. / by Fu Liu. / Ph.D.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/34542 |
| Date | January 2006 |
| Creators | Liu, Fu, Ph. D. Massachusetts Institute of Technology |
| Contributors | Richard P. Stanley., Massachusetts Institute of Technology. Dept. of Mathematics., Massachusetts Institute of Technology. Dept. of Mathematics. |
| Publisher | Massachusetts Institute of Technology |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | 91 p., 4050922 bytes, 4054663 bytes, application/pdf, application/pdf, application/pdf |
| Rights | M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission., http://dspace.mit.edu/handle/1721.1/7582 |
Page generated in 0.0017 seconds