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:23


Program  |  Deadlines  |  Inquiries:  meet@ams.org

1995 Fall Southern Sectional Meeting
Greensboro, NC, November 17-18, 1995
Meeting #906

Associate secretaries:
Robert J Daverman, AMS daverman@math.utk.edu

Special Session on Theory of Ordered Sets

  • Friday November 17, 1995, 9:00 a.m.-10:50 a.m.
    Special Session on Theory of Ordered Sets, I

    Blue Ridge, Greensboro Hilton Hotel
    Organizers:
    Bernd S. W. Schroeder, Hampton University

    • 9:00 a.m.
      Problems related to the fixed point property for products of ordered sets.
      Bernd Schroeder*, Hampton University
      (906-06-93)
    • 9:30 a.m.
      Perfect sequences of chain-complete posets.
      Jonathan David Farley*, University of Oxford, England
      (906-06-167)
    • 10:00 a.m.
      Several complexity problems involving ordered sets.
      Dwight A. Duffus*, Emory University
      Ted Goddard, Emory University
      (906-06-158)
    • 10:30 a.m.
      Discussion
  • Saturday November 18, 1995, 8:30 a.m.-10:50 a.m.
    Special Session on Theory of Ordered Sets, II

    Kitty Hawk, Greensboro Hilton Hotel
    Organizers:
    Bernd S. W. Schroeder, Hampton University

    • 8:30 a.m.
      Reduced idempotents in the semigroup of Boolean matrices.
      Janusz Konieczny*, Mary Washington College
      (906-20-94)
    • 9:00 a.m.
      The "Proper versus unit" question for some generalizations of interval orders.
      Kenneth P. Bogart*, Dartmouth College
      (906-06-165)
    • 9:30 a.m.
      On the equational theory of orthocomplemented modular lattices.
      Christian Herrmann, Technische Hochschule Darmstadt, Germany
      Michael S. Roddy*, Brandon University
      (906-06-170)
    • 10:00 a.m.
      Some results concerning a chain transversing an antichain partition.
      Dwight A. Duffus, Emory University
      Ted Goddard*, Emory University
      (906-06-157)
    • 10:30 a.m.
      The complexity of cover graph recognition for some varieties of finite lattices.
      V. Rodl, Emory University
      Lubos Thoma*, Emory University
      (906-06-190)
Inquiries:  meet@ams.org