AMS Meeting Program by Special Session

Current as of Tuesday, April 12, 2005 15:08:43

Program  |  Deadlines  |  Inquiries:

Joint Summer Meeting
Columbus, OH, August 8-11, 1990
Meeting #859

Associate secretaries:
W Wistar Comfort, AMS
Kenneth A Ross, MAA

AMS Special Session on Combinatorics

  • Thursday August 9, 1990, 7:00 a.m.-10:50 a.m.
    AMS Special Session on Combinatorics, I

    • 7:00 a.m.
      Voltage-current duality.
      Dan Archdeacon*, University of Vermont
    • 7:30 a.m.
      Bounds on the distance-d domination number.
      Joan P. Hutchinson*, Macalester College
    • 8:00 a.m.
      Subgraphs with crossing number 2.
      Dan McQuillan, Carleton University
      R. B. Richter*, Carleton University
    • 8:30 a.m.
      Graphs containing crossing number 2 graphs.
      Richard Vitray*, Appalachian State University
    • 9:00 a.m.
      Ideal secret sharing schemes and matroids.
      Ernest F. Brickell*, Sandia National Laboratories
      Daniel M. Davenport, Sandia National Laboratories
    • 9:30 a.m.
      Howell designs with sub-designs.
      J. H. Dinitz*, University of Vermont
      E. R. Lamken, Institute for Defense Analyses
    • 10:00 a.m.
      Mappings of sets of pairwise orthogonal orthomorphisms.
      Robert Roth*, Emory University
    • 10:30 a.m.
      Singularity probabilities for random {+ minus}-matrices.
      Jeff Kahn*, Rutgers University, New Brunswick
      J\'anos Koml\'os, Rutgers University, New Brunswick
      Endre Szemer\'edi, Rutgers University, New Brunswick
  • Friday August 10, 1990, 1:30 p.m.-3:50 p.m.
    AMS Special Session on Combinatorics, II

    • 1:30 p.m.
      Graphs, games and structure theorems.
      Neil Robertson, Ohio State University, Columbus
      P. D. Seymour, Bellcore, Morristown, New Jersey
      Robin Thomas*, Georgia Institute of Technology
    • 2:00 p.m.
      Supeulerian and collapsible graphs.
      Paul A. Catlin*, Wayne State University
    • 2:30 p.m.
      A characterization in Z^n of unit-distance graphs in R^n.
      Kiran B. Chilakamarri*, Ohio State University, Columbus
    • 3:00 p.m.
      Loop transversals to linear codes.
      Jonathan D. H. Smith*, Iowa State University
    • 3:30 p.m.
      Large sets of disjoint t-designs.
      Yeow Meng Chee, University of Waterloo
      Charles J. Colbourn, University of Waterloo
      Steven C. Furino, University of Waterloo
      Donald L. Kreher*, University of Wyoming
  • Saturday August 11, 1990, 7:00 a.m.-10:50 a.m.
    AMS Special Session on Combinatorics, III

    • 7:00 a.m.
      Delsarte's inequalities and t-designs.
      Richard M. Wilson*, California Institute of Technology
    • 7:30 a.m.
      Association schemes on triples and a ternary algebra.
      Dale M. Mesner, University of Nebraska, Lincoln
      Prabir Bhattacharya*, University of Nebraska, Lincoln
    • 8:00 a.m.
      Cycle ideals and tactical partitions of distance-regular graphs.
      Aaron D. Meyerowitz*, Florida Atlantic University
    • 8:30 a.m.
      A large set of designs on vector spaces.
      D. K. Ray-Chaudhuri, Ohio State University, Columbus
      Erin J. Schram*, Ohio State University, Columbus
    • 9:00 a.m.
      Structure theory of planar graphs embedded on nonplanar surfaces.
      Bojan Mohar, University of Ljubljana, Yugoslavia
      Neil Robertson*, Ohio State University, Columbus
      Richard Vitray, Appalachian State University
    • 9:30 a.m.
      Leafless trees in countable graphs.
      Bogdan Oporowski*, Louisiana State University, Baton Rouge
    • 10:00 a.m.
      Incidence matrices in geometric lattices.
      Joseph P. S. Kung*, University of North Texas
    • 10:30 a.m.
      Strong Tutte functions of matroids and graphs.
      Thomas Zaslavsky*, State University of New York, Binghamton
  • Saturday August 11, 1990, 12:00 p.m.-2:20 p.m.
    AMS Special Session on Combinatorics, IV

    • 12:00 p.m.
      Large sets of disjoint combinatorial structures.
      Luc Teirlinck*, Auburn University, Auburn
    • 12:30 p.m.
      Invariant linear forms and regularity in codes and designs.
      A. R. Calderbank*, AT&T Bell Laboratories, Murray Hill, New Jersey
    • 1:00 p.m.
      Designs from maximal arcs and difference sets.
      J. F. Dillon*, National Security Agency
    • 1:30 p.m.
      The subconstituent algebra of a graph of thin type.
      Paul Terwilliger*, University of Wisconsin, Madison
    • 2:00 p.m.
      On the diameter of Cayley graphs of permutation groups.
      Laszlo Babai, University of Chicago
      Akos Seress*, Ohio State University, Columbus

American Mathematical Society