home archive

MIT Combinatorics Seminar Schedule (FALL 2005 )

  W  Sept. 14   Igor Rivin
Geometry of Polyhedra
  F  Sept. 16   Gil Kalai
Unions And Intersections Of Leray Complexes
  W  Sept. 21   Csaba David Toth
Point-Hyperplane Incidence Bounds And Applications
  W  Sept. 28   Ben Green
Clique Number Of Random Cayley Graphs
  F  Sept. 30   Satyan Devadoss
Point Configurations And Coxeter Operads
  W  Oct. 5   Dimitri Leemans
Incidence Geometry, Finite Group Theory And Computational Algebra
  F  Oct. 7   Janos Pach
New Results On Old Crossing Numbers (Or Old Results On New Ones?)
  F  Oct. 14   Vladimir Retakh
On A Class Of Algebras Associated With Directed Graphs
  W  Oct. 19   David Speyer
Combinatorial Models For The Octahedron And Cube Recurrences
  F  Oct. 21   Anders Bjorner
Blockers, Subspace Arrangements And Ideals
  W  Oct. 26   Rados Radoicic
Ramsey-Type Results For The Hypercube
  F  Oct. 28   John Stembridge
Disproving The Neggers Conjecture
  W  Nov. 2   Ezra Miller
Tableau Complexes
  F  Nov. 4   Eyal Ackerman
On The Maximum Number Of Edges In $k$-Quasi-Planar Graphs
  W  Nov. 9   Andrei M. Raigorodskii
Borsuk's Problem And The Chromatic Number Of A Space Problem
  Th  Nov. 10   Maria Chudnovsky
The Structure Of Bullfree Graphs
  W  Nov. 16   Marcelo Aguiar
Factorization Of Hopf Algebra Characters
  W  Nov. 30   Clifford Smyth
Ramsey And Anti-Ramsey Theorems
  W  Dec. 7   Seth Sullivant
Combinatorial Secant Varieties
  W  Dec. 14   Robert Boyer
Zero Distributions For Polynomials Arising In Combinatorics