dc.creator | Fitzpatrick, Justin Liam | |
dc.date.accessioned | 2020-08-22T20:45:25Z | |
dc.date.available | 2010-08-13 | |
dc.date.issued | 2010-08-13 | |
dc.identifier.uri | https://etd.library.vanderbilt.edu/etd-08092010-093437 | |
dc.identifier.uri | http://hdl.handle.net/1803/13862 | |
dc.description.abstract | This thesis discusses recent and classical results concerning the asymptotic properties (as N gets large) of ``ground state' configurations of N particles restricted to a compact set A of Hausdorff dimension d interacting through through an inverse power law 1/r^s for some s>0.
It has been observed that, as s becomes large, ground state configurations approach best-packing configurations on A. When d=2, it is generally believed that ground state configurations form a hexagonal lattice. This thesis aims to justify this belief in the case d=2 through the study of geometric inequalities for polygons. Specifically, it is shown that, when s is large, a normalized energy associated to interactions from particles that are ``nearest neighbors' to a fixed point in the configuration is minimized when the nearest neighbors form a regular polygon. This technique provides new lower bounds for the energy for 2-dimensional ground state configurations. | |
dc.format.mimetype | application/pdf | |
dc.subject | Riesz energy | |
dc.subject | geometric inequalities | |
dc.subject | Voronoi diagrams | |
dc.subject | best-packing | |
dc.title | The Geometry of Optimal and Near-Optimal Riesz Energy Configurations | |
dc.type | dissertation | |
dc.contributor.committeeMember | Gieri Simonett | |
dc.contributor.committeeMember | James Dickerson | |
dc.contributor.committeeMember | Emmanuele DiBenedetto | |
dc.contributor.committeeMember | Edward B. Saff | |
dc.type.material | text | |
thesis.degree.name | PHD | |
thesis.degree.level | dissertation | |
thesis.degree.discipline | Mathematics | |
thesis.degree.grantor | Vanderbilt University | |
local.embargo.terms | 2010-08-13 | |
local.embargo.lift | 2010-08-13 | |
dc.contributor.committeeChair | Douglas Hardin | |