Spring 2011 Reading Seminar
This Spring we will meet on Wednesdays at 4:40pm in MSB 3106 and will be reading a variety of papers of interest,
most of which are recent exciting developments in the field of optimization. We will attempt to provide a list of
these papers below,and potentially a schedule of when these papers will be discussed.
April 6 : Jesus De Loera presenting: Lifting projections of convex polyhedra, and results from a newer paper
April 13: Mark Junod presenting: Hass, Largarias, Pippenger (1998) http://arxiv.org/abs/math/9807016
April 20:
April 27:
May 4 :
.
.
.
Here are other papers that will potentially be presented this quarter:
-David W. Walkup and Roger J.-B. Wets(1969
Lifting projections of convex polyhedra
- Joel Hass, Jeffrey C. Lagarias, Nicholas Pippenger (1998):
The Computational Complexity of Knot and Link Problems
http://arxiv.org/abs/math/9807016
-Sergei Chubanov (2011):
A strongly polynomial algorithm for linear systems having a binary solution
http://www.springerlink.com/content/j472ljkx00763563/
-Jozsef Solymosi, Terence Tao (2011):
An incidence theorem in higher dimensions