AMS Sectional Meeting Program by Special Session

Current as of Tuesday, April 12, 2005 15:21:29

Associate secretaries:
Lesley M Sibner, AMS lsibner@duke.poly.edu

Saturday April 28, 2001, 9:30 a.m.-10:40 a.m.
Special Session on Matchings in Graphs and Hypergraphs, I
Room 323, Edwin A. Stevens (EAS) Hall
Organizers:
Alexander Barvinok, University of Michigan barvinok@math.lsa.umich.edu
Alex Samorodnitsky, Institute for Advanced Study asamor@ias.edu
- 9:30 a.m.
  \bf A generalization of mixed discriminants and an attempt of Quantum matching theory.
  Leonid Gurvits*, Los Alamos National Laboratory
  (966-05-106)
- 10:10 a.m.
  An inequality for polymatroid functions and its applications.
  Endre Boros, Rutcor, Rutgers University
  Khaled Elbassioni, Department of Computer Science, Rutgers University
  Vladimir Gurvich, Rutcor, Rutgers University
  Leonid Khachiyan*, Department of Computer Science, Rutgers University
  (966-68-134)

Saturday April 28, 2001, 2:30 p.m.-4:20 p.m.
Special Session on Matchings in Graphs and Hypergraphs, II
Room 323, Edwin A. Stevens (EAS) Hall
Organizers:
Alexander Barvinok, University of Michigan barvinok@math.lsa.umich.edu
Alex Samorodnitsky, Institute for Advanced Study asamor@ias.edu
- 2:30 p.m.
  Approximating the permanent.
  Mark Jerrum, Edinburgh
  Alistair Sinclair, Berkeley
  Eric Vigoda*, Edinburgh
  (966-68-84)
- 3:10 p.m.
  Remarks on the complexity of RAS algorithm, application in permanent and perfect matching, and a generalization in scaling linear operators over the cone of positive definite matrices.
  Bahman Kalantari*, Rutgers University
  (966-15-163)
- 3:50 p.m.
  Applications of Sinkhorn balancing: low-cost approximations for hard problems.
  Francis Sullivan*, IDA Center for Computing Sciences
  Isabel Beichl, NIST
  (966-05-20)

Sunday April 29, 2001, 9:30 a.m.-10:40 a.m.
Special Session on Matchings in Graphs and Hypergraphs, III
Room 323, Edwin A. Stevens (EAS) Hall
Organizers:
Alexander Barvinok, University of Michigan barvinok@math.lsa.umich.edu
Alex Samorodnitsky, Institute for Advanced Study asamor@ias.edu
- 9:30 a.m.
  Line Graphs and Forbidden Induced Subgraphs.
  Hong-Jian Lai*, West Virginia University
  Lubo Soltes, Memphis, TN
  (966-05-31)
- 10:10 a.m.
  Vertex Arboricity and Girth.
  Zhan Mingquan*, West Virginia University
  Lai Hongjian, West Virginia University
  (966-05-33)

Sunday April 29, 2001, 2:30 p.m.-5:00 p.m.
Special Session on Matchings in Graphs and Hypergraphs, IV
Room 323, Edwin A. Stevens (EAS) Hall
Organizers:
Alexander Barvinok, University of Michigan barvinok@math.lsa.umich.edu
Alex Samorodnitsky, Institute for Advanced Study asamor@ias.edu
- 2:30 p.m.
  Generalization of Hall's Theorm to Families of Hypergraphs.
  Ron Aharoni, Technion
  Maria Chudnovsky*, Princeton University
  Andrei Kotlov, CWI
  (966-05-60)
- 3:10 p.m.
  Hypergraph Matching and Homology.
  Roy Meshulam*, IAS/Technion
  (966-05-146)
- 3:50 p.m.
  On phase transition for the hard-core model on ${\bf Z}^d$.
  Jeffry N. Kahn*, Rutgers University
  David Galvin, Rutgers University
  (966-70-101)
- 4:30 p.m.
  Triangle factors in pseudo-random graphs.
  Michael Krivelevich, Tel Aviv University
  Benny Sudakov*, Princeton University and IAS
  Tibor Szabo, ETH
  (966-05-149)

Inquiries: meet@ams.org