Discrete Geometry and Combinatorics Seminar

Discrete Geometry and Combinatorics Seminar

List of Talks given in 2006-07

Wednesday, August 30   Veit Elser, Cornell University
An iterated map that solves hard problems
Tuesday, September 5   Igor Pak, MIT
Inflating polyhedral surfaces
Wednesday, September 13   Brant Jones, University of Washington
Embedded factor patterns and Deodhar's algorithm for Kazhdan-Lusztig polynomials
Wednesday, September 27   Edward Swartz, Cornell University
The coloring complex
Tuesday, October 3   Gil Kalai, Hebrew University and Yale University
Harmonic analysis of Boolean functions
Wednesday, October 11   Robert Connelly, Cornell University
Packing of ellipses and ellipsoids - a model for granular material
Wednesday, October 18   Tom Zaslavsky, Binghamton University
Topological hyperplanes
Wednesday, October 25   Brigitte Servatius, Worcester Polytechnic Institute
What's new in dimension two?
Wednesday, November 1   Doris Schattschneider, Moravian College
Escher's combinatorial patterns and their aftermath
Tuesday, November 14   Greg Kuperberg, University of California at Davis
From the Mahler conjecture to Gauss linking forms
Wednesday, November 15   Tara Holm, Cornell University
The combinatorial structure of moment polytopes
Wednesday, November 29   Ileana Streinu, Smith College
Enumerating planar minimally rigid graphs
Wednesday, January 24   Victor Alexandrov, Sobolev Institute of Mathematics and Cornell University
Minkowski-type and A. D. Alexandrov-type theorems for hedgehogs
Wednesday, January 31   Robert Connelly, Cornell University
Attaching adornments to expanding chains
Wednesday, February 7   Tom Zaslavsky, Binghamton University
A lattice point counting problem with weird gain graphs
Wednesday, February 28   David Speyer, University of Michigan
Decompositions of matroid polytopes and a new matroid invariant
Wednesday, March 7   I. Sabitov, Moscow State University
Some results on infinitesimal and continuous rigidity of surfaces and polyhedra
Wednesday, March 14   Megan Owen, Cornell University
Computing the distance between phylogenetic trees
Wednesday, March 28   Caroline Klivans, University of Chicago
A simplicial matrix tree theorem
Wednesday, March 28   Margaret Readdy, University of Kentucky
Affine and toric hyperplane arrangements
Wednesday, March 28   Richard Ehrenborg, University of Kentucky
Eulerian binomial and Sheffer posets
Wednesday, April 11   Joe Mitchell, Stony Brook University
Improved approximation algorithms for TSP with neighborhoods and related geometric network optimization problems
Monday, April 16   Walter Whiteley and Wendy Finbow-Sing, York University and St. Mary’s University and York
Generic rigidity of spheres with holes and blocks, with applications
Wednesday, April 18   Sonja Cukic, Binghamton University
Bier spheres and other shellable simplicial spheres
Wednesday, April 25   David Gale, University of California at Berkeley
Topological games at Princeton, a mathematical memoir
Wednesday, May 2   Dylan Thurston, Columbia University
Characterizing generic global rigidity of graphs