Friday, May 14

MS52
Fast Generation of Combinatorial Structures

Sponsored by SIAM Activity Group on Discrete Mathematics (Invited Minisymposium)

4:15 PM-6:15 PM PM
Room: Savannah 1

Many scientific and mathematical investigations begin with an exhaustive examination of all possible cases of small instances of a problem. Often these possiblities have some combinatorial structure. There is a growing and maturing methodology for attacking such problems in a systematic manner. The purpose of this minisymposium is to present some recent results in the area, including listing all equivalence classes of structures under group actions, and structures arising in partially ordered set theory. The speakers will describe applications to the generation of certain molecules and enumerative aspects of finite field theory.

Organizer: Frank Ruskey
University of Victoria, Canada

4:15-4:40 Generating Combinatorial Objects -- Necklaces in Particular

Frank Ruskey, Organizer

Cancelled 4:45-5:10 On Some Generation Problems Related to Lattices

Michel Habib, LIRMM, Montpellier, France

4:45-5:10 Gray Codes for Blockfree Sets and Words

Carla Savage, North Carolina State University

5:15-5:40 The Enumeration of Generalized Fullerenes

Thomas Harmuth and Gunnar Brinkmann, Universität Bielefeld, Germany

5:45-6:10 Generating Representatives of Isomorphism Classes

Brendan McKay, Australian National University, Canberra, Australia

AN99 Home

Program

Program Updates

Speaker Index

Hotel

Transportation

Registration

tjf, 1/19/99, MMD, 5/13/99