Classical Combinatorics

In honor of Dominique Foata's 65th birthday

Temple University
1616 Walnut Street, Philadelphia, PA
July 7-9, 2000

Participants | Poster | Schedule of Speakers

Expense Report Info | At the Banquet | Dominique's Doctorate Directions

Proceedings Information: All participants (both speakers and non-speakers) are cordially invited to contribute to the refereed proceedings for "Classical Combinatorics" which will be published as a special issue of Advances in Applied Mathematics.

Please send your contribution to Joseph Kung at The deadline for submissions has been extended to January 1, 2001.

The term Classical Combinatorics, coined by Dominique Foata, is roughly the combinatorial analog of Classical Analysis. Today it is better know as Enumerative and Algebraic Combinatorics. One of the fastest growing areas of modern mathematics, it touches upon many areas of mathematics and science. This conference will emphasize the more classical aspects of enumerative combinatorics, like permutation statistics, tableaux, q-series, words, combinatorial special function theory, commutation monoids, and related subjects, as well as their relation to computer science, physics, and statistics.

Organized by: George Andrews, Richard A. Askey, Aaron Robertson (co-chair), Herbert S. Wilf, and Doron Zeilberger (co-chair).

Supported by: National Science Foundation and Temple University