MIT Combinatorics Seminar Schedule (Fall 2006 )

• Sept. 13: Benny Sudakov (Princeton University)
  Expansion of H-Free Graphs and its Applications
• Sept. 20: Sergi Elizalde (Dartmouth University)
  A Bijection Between 2-Triangulations and Pairs of Non-Crossing Dick Paths
• Sept. 27: Thomas Lam (Harvard Unviversity)
  Tableaux and Insertion for Affine Schubert Calculus
• Sept. 29: Izzet Coskun (MIT)
  Positivity in the Cohomology of Homogeneous Varieties
• Oct. 4: Jakob Jonsson (MIT)
  Homology of the Matching Complex
• Oct. 6: Jason Morton(University of California Berkeley)
  Semigraphoids and the Permutohedron
• Oct. 11: Karl Mahlburg (MIT)
  The Andrews-Garvan-Dyson Crank and Partition Congruences
• Oct. 18: Uli Wagner (Hebrew University of Jerusalem)
  On a Geometric Generalization of the Upper Bound Theorem
• Oct. 25: Boris Aronov (Brooklyn Polytechnic University)
  Unions of Objects
• Oct. 27: Alexander Yong (Minnesota/Fields Institute)
  A Combinatorial Rule for (co)Minuscule Schubert Calculus
• Nov. 1: Todd Kemp (MIT)
  Haagerup's Inequality and Free Cumulants
• Nov. 3: Terada Itaru (University of Tokyo)
  The Jordan Type of Nilpotent Matrices With Certain Constraints
• Nov. 8: Ezra Miller (University of Minnesota and Ann Arbor)
  Hypergeometric Series and Binomial Primary Decomposition
• Nov. 15: Barry Monson (UNB and Northeastern University)
  Symmetric Graphs and Polytopes
• Nov. 16: Bettina Speckmann (Eindhoven)
  Kinetic Collision Detection for Convex Fat Objects
• Nov. 17: Sylvie Corteel (CNRS and Universite Paris-Sud)
  Permutation tableaux and the partially asymmetric exclusion process
• Nov. 29: Dan Romik (Bell Laboratories)
  Random Sorting Networks
• Dec. 1: Sami Assaf (UC Berkeley)
  Dual equivalence graphs, ribbon tableaux and Macdonald polynomials
• Dec. 6: Mihai Ciucu (Georgia Tech)
  The emergence of the electrostatic field as a Feynman sum in random tilings with holes
• Dec. 8: David Speyer (University of Michigan)
  Polyhedral geometry of Cambrian lattices