Quantitative Combinatorial Geometry with Applications to Number Theory and Optimization
<p> This dissertation contains a variety of results in quantitative combinatorial geometry, as well as applications to optimization and number theory. </p><p> We use Ehrhart theory, the study of the number of lattice points in polytopes, to prove a Rainbow Ramsey analogue of Rich...
Main Author: | La Haye, Reuben N. |
---|---|
Language: | EN |
Published: |
University of California, Davis
2016
|
Subjects: | |
Online Access: | http://pqdtopen.proquest.com/#viewpdf?dispub=10165904 |
Similar Items
-
Combinatorial geometries in model theory
by: Ahlman, Ove
Published: (2009) -
Semidefinite programming in combinatorial optimization with applications to coding theory and geometry
by: Passuello, Alberto
Published: (2013) -
Extremal problems in combinatorial geometry and Ramsey theory
by: RadoiÄ iÄ , RadoÅ¡, 1978-
Published: (2006) -
The dichotomy between structure and randomness and applications to combinatorial number theory
by: Richter, Florian K.
Published: (2018) - Effective Methods in Intersection Theory and Combinatorial Algebraic Geometry