Combinatorics Seminars
2004 – 2005


Address: Mathematics 253-37 | Caltech | Pasadena, CA 91125
Telephone: (626) 395-4335 | Fax: (626) 585-1728


 

  • Thursday, June 9, 2005
    Daniel Pragel (Caltech)
    Central digraphs, central groupoids and zero-one matrices A such that A2 = J
    11:00 a.m.  // 159 Sloan
  • Thursday, June 2, 2005
    Peter Keevash (Caltech)
    Pairwise intersections and forbidden configurations
    11:00 a.m.  // 159 Sloan
  • Thursday, May 26, 2005
    Yuval Roichman (Bar-Ilan University)
    Statistics on permutation groups, canonical words and pattern avoidance
    11:00 a.m.  // 159 Sloan
  • Thursday, May 19, 2005
    Paul Zinn-Justin (Paris-Sud)
    Toward a proof of the Razumov-Stroganov conjecture?
    11:00 a.m.  // 159 Sloan
     
  • Thursday, May 12, 2005
    Terence Tao (UCLA)
    The determinant and singularity probability of a random ±1 matrix
    11:00 a.m.  // 159 Sloan
  • Thursday, May 5, 2005
    Allen Knutson (UC  Berkeley)
    The glue between Young tableaux

    11:00 a.m.  // 159 Sloan
  • Thursday, April 21, 2005
    Richard Wilson (Caltech)
    Revisiting the (t, k)-subset inclusion matrices

    11:00 a.m.  // 159 Sloan
  • Thursday, April 14, 2005
    Benny Sudakov (Princeton University)
    Max Cut - combinatorial perspective

    11:00 a.m.  // 159 Sloan
  • Thursday, March 3, 2005
    Dhruv Mubayi (University of Illinois)
    New developments on Ramsey-Turan theory for hypergraphs

    11:00 a.m.  // 159 Sloan
  • Thursday, February 17, 2005
    Peter Dukes (University of Victoria)
    The cycle structure of uniform one-factorizations from starters in finite fields
    11:00 a.m.  // 159 Sloan
  • Thursday, February 10, 2005
    Carlos Salazar-Lazaro (Caltech)
    Progress on the existence problem of skew Hadamard difference sets

    11:00 a.m.  // 159 Sloan
  • Thursday, January 20, 2005
    Pawel Wocjan (Caltech)
    Limitations of nice mutually unbiased bases

    11:00 a.m.  // 159 Sloan
  • Thursday, November 18, 2004
    Pawel Wocjan (Caltech)
    Eulerian orthogonal arrays
    11:00 a.m.  // 159 Sloan
  • Thursday, November 11, 2004
    Noam Berger (Caltech)
    Mixing time for the biased card shuffling and the asymmetric exclusion process
    11:00 am   //  Rm. 159 Sloan 
  • Thursday, October 28, 2004
    Peter Keevash (Caltech)
    Multicoloured extremal problems
    11:00 am   //  Rm. 159 Sloan 
     
  • Thursday, October 21, 2004
    Pawel Wocjan (Caltech)
    New construction of mutually unbiased bases in square dimensions
    11:00 a.m.  // 159 Sloan
  • Thursday, October 14, 2004
    Richard Wilson (Caltech)
    Incidence matrices and a zero-sum Ramsey-type problem
    11:00 a.m.  // 159 Sloan
  • Thursday, October 7, 2004
    Peter Keevash (Caltech)
    The role of approximate structure in extremal combinatorics
    11:00 a.m.  // 159 Sloan
  • Thursday, September 30, 2004
    Daniel Katz (Caltech)
    A theorem of N. Katz from a generalization of McEliece's theorem
    11:00 a.m.  // 159 Sloan

 

 

 

Math Home

Seminars

Caltech Home


For further information, please contact Kathy Carreon at (626) 395-4335
or kcarreon@caltech.edu.