Combinatorics Seminars
2001 – 2002
Address: Mathematics
253-37 | Caltech | Pasadena, CA 91125
Telephone: (626) 395-4335 | Fax: (626) 585-1728
- Thursday, May 16, 2002
Michael Mossinghoff (UCLA)
Slicing the n-dimensional cube
11:00 a.m. // 159 Sloan
- Thursday, May 9, 2002
James Stein (Cal State, Long Beach)
Ramsey redux: The Banach contraction principle
11:00 a.m. // 159 Sloan
- Thursday, May 2, 2002
Avner Magen (NEC Research)
Compatible systems and rigidity
11:00 a.m. // 159 Sloan
- Thursday, April 25, 2002
A.A. Ivanov (Imperial College)
On graphs which are locally a given graph
11:00 a.m. // 159 Sloan
- Thursday, April 11, 2002
Jeong Han Kim (Microsoft Research)
Random regular graphs, random graphs, and couplings
11:00 a.m. // 159 Sloan
- Thursday, March 7, 2002
Tewodros Amdeberhan (DeVry College of Technology/DIMACS)
Determinant through the looking glass
11:00 am // 159 Sloan
- Thursday, February 21, 2002
Richard Wilson (Caltech)
k-wise set intersections and Hamming distances
11:00 a.m. // 159 Sloan
- Thursday, February 7, 2002
Peter Dukes (Caltech)
Design inequalities from convex cones
11:00 a.m. // 159 Sloan
- Thursday, January 31, 2002
Xun Dong (Caltech)
Signed posets and Hibi rings
11:00 a.m. // 159 Sloan
- Thursday, December 6, 2001
Harvey Friedman (Ohio State University)
Enormous integers in real life
11:00 a.m. // 159 Sloan
- Thursday, November 29, 2001
Shahriar Shahriari (Pomona College)
Surreal factorization
11:00 a.m. // 159 Sloan
- Tuesday, November 20, 2001
J. Maurice Rojas (Texas A&M University)
Multivariate Descartes rule: Real, arithmetic, and algorithmic aspects
11:00 a.m. // 153 Sloan
- Thursday, November 15, 2001
David Grynkiewicz (Caltech)
Zero-sum generalized Ramsey theory: A problem of Bialostocki,
Erdös, and Lefmann on sets with nondecreasing diameter
11:00 a.m. // 159 Sloan
- Thursday, November 8, 2001
Xun Dong (Caltech)
Bounded degree graph complexes
11:00 a.m. // 159 Sloan
- Thursday, November 1, 2001
Shawn Cokus (UCLA)
Linear algebra through fuzzy glasses
11:00 a.m. // 159 Sloan
- Thursday, October 25, 2001
Peter Dukes (Caltech)
Report on the 15th Mid-West Conference on Combinatorics, Cryptography, and Computing
11:00 a.m. // 159 Sloan
- Thursday, October 18, 2001
Vladimir Levenshtein (Russian Academy of Sciences)
A universal bound for a covering in regular posets and
its applications to pool testing
11:00 a.m. // 159 Sloan