**RFG on Applications of Convex Geometry, Spring Session**

We are running two parallel activities this Spring.

__READING CLUB WITH MATROID RFG__

__JOURNAL CLUB ON ASPECTS OF LINEAR OPTIMIZATION AND RELATED DISCRETE GEOMETRY__

April 6 : Jesus De Loera presenting:

April 13: Mark Junod presenting: Hass, Largarias, Pippenger (1998) The Computational Complexity of Knot and Link Problems, Burton, (2010) The Complexity of the Normal Surface Solution Space and Burton, (2010), Optimizing the Double Description Method for Normal Surface Enumeration.

April 20 : Yvonne Kemper presenting: Lower Bounds for h-Vectors of k-CM, Independence, and Broken Circuit Complexes, Edward Swartz, (2011).

April 27 : Matthew C. Reed presenting: An incidence theorem in higher dimensions, Joszef Solymosi and Terence Tao, (2011).

May 4 : Rex Cheung, Brandon Dutra, Greg Pinto, Mark Junod presenting:

SPECIAL EVENT !!

May 6 : Prof Yinyu Ye from Stanford speaks at the SIAM Student Research Conference on The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate.May 11 : Andrew Herrmann and Robert Hildebrand presenting: A strongly polynomial algorithm for linear systems having a binary solution.

May 18 : Andrew and Robert continue with the above presentation.

SPECIAL EVENT !!

May 25 : Marco Molinaro from Carnegie Mellon University presentingJune 1 : Robert Hildebrand presenting: A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations by Micciancio and Voulgaris. Here is the presentation that Robert gave.

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.
- Sergei Chubanov (2011): A strongly polynomial algorithm for linear systems having a binary solution.
- Jozsef Solymosi, Terence Tao (2011): An incidence theorem in higher dimensions.

- Yinyu Ye, (2010), The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate.
- O. Friedmann, T. D. Hansen, U. Zwick, Subexponential lower bounds for randomized pivoting rules for solving linear programs.

- I. Adler and R. Saigal, (1976), Long Monotone Paths in Abstract Polytopes.
- Katta G. Murty, (1973), The Graph of an Abstract Polytope.
- Nicolai Hahnle, 2011, An abstract view on the polynomial Hirsch conjecture.