American Mathematical Society

My Account · My Cart · Customer Services · FAQ  

AMS Sectional Meeting Program by Special Session

Current as of Tuesday, April 12, 2005 15:09:04


Program  |  Deadlines  |  Inquiries:  meet@ams.org

Central 1993 Spring Sectional Meeting
DeKalb, IL, May 20-23, 1993
Meeting #882

Associate secretaries:
Andy R Magid, AMS amagid@ou.edu

Special Session on Probabilistic Methods

  • Friday May 21, 1993, 3:00 p.m.-4:20 p.m.
    Special Session on Probabilistic Methods, I

    Room 204A, DuSable Hall

    • 3:00 p.m.
      Minimal absolute values of random trigonometric polynomials.
      A. M. Odlyzko*, AT&T Bell Laboratories, Murray Hill, New Jersey
      (882-60-103)
    • 3:30 p.m.
      A normal law for matchings.
      Jeff Kahn*, Rutgers University, New Brunswick
      (882-05-167)
    • 4:00 p.m.
      On random matchings in regular graphs.
      Jeff Kahn, Rutgers University, New Brunswick
      Jeong Han Kim*, Rutgers University, New Brunswick
      (882-05-166)
  • Saturday May 22, 1993, 8:00 a.m.-9:20 a.m.
    Special Session on Probabilistic Methods, II

    Room 204A, DuSable Hall

    • 8:00 a.m.
      On the distribution of sums of residues.
      Jerrold R. Griggs*, University of South Carolina, Columbia
      (882-11-190)
    • 8:30 a.m.
      An upper bound for the solvability probability of a random stable roommates instance.
      Robert W. Irving, University of Glasgow, Scotland
      Boris Pittel*, Ohio State University, Columbus
      (882-05-55)
    • 9:00 a.m.
      Connectedness and isolated points.
      Rod Canfield*, University of Georgia
      (882-05-180)
  • Saturday May 22, 1993, 3:00 p.m.-5:20 p.m.
    Special Session on Probabilistic Methods, III

    Room 204A, DuSable Hall

    • 3:00 p.m.
      A random representation of the complete bipartite graph.
      Zolt\'an F\"uredi*, University of Illinois, Urbana-Champaign
      (882-05-182)
    • 3:30 p.m.
      On the Lovasz local lemma.
      Jozsef Beck*, Rutgers University, New Brunswick
      (882-05-56)
    • 4:00 p.m.
      Embedding bounded degree trees into graphs.
      Endre Szemer\'edi*, Rutgers University, New Brunswick
      (882-05-165)
    • 4:30 p.m.
      First-order properties of random substructures.
      Miklos Ajtai*, IBM Almaden Research Center, San Jose, California
      (882-05-183)
    • 5:00 p.m.
      Threshold for collapsibility in random graphs.
      E. M. Palmer, Michigan State University
      Joseph J. Spencer*, Michigan State University
      (882-05-57)
  • Sunday May 23, 1993, 9:00 a.m.-10:50 a.m.
    Special Session on Probabilistic Methods, IV

    Room 204A, DuSable Hall

    • 9:00 a.m.
      Asymptotic bases for numbers by probability methods.
      Prasad Tetali*, AT&T Bell Laboratories, Murray Hill, New Jersey
      (882-11-54)
    • 9:30 a.m.
      Eigenvalues and routing in graphs.
      Fan R. K. Chung*, Bellcore, Morristown, New Jersey
      (882-05-181)
    • 10:00 a.m.
      The Janson inequalities.
      Joel Spencer*, Courant Institute of Mathematical Sciences, New York University
      (882-05-179)
    • 10:30 a.m.
      Bounds on the expected number of k-sets.
      William Steiger*, Rutgers University, New Brunswick
      (882-52-146)
Inquiries:  meet@ams.org