|
TENTATIVE PROGRAM
|
Monday
|
|
9.30
|
Welcome
|
10.00
|
Mike Atkinson:Simple permutations, partial
well-order, and enumeration
|
11.00
|
Coffee
|
11.30
|
Astrid Reifegerste: Permutation diagrams and
forbidden patterns
|
12.30
|
Lunch
|
2.00
|
Max Murphy: Fundamental antichains
|
2.30
|
Vince Vatter: Taming sets of permutations
|
3.00
|
Tea
|
3.30
|
Miklos Bona: A simplicial complex of 2-stack
sortable permutations
|
Tuesday
|
|
10.00
|
Herb Wilf: Longest increasing subsequences
in pattern-restricted permutations
|
11.00
|
Coffee
|
11.30
|
Michael Albert: Sorting with a forklift truck
|
12.30
|
Lunch
|
2.00
|
Julian West: Is there always a largest Wilf
class?
|
3.00
|
Tea
|
3.30
|
Uri Rothblum: Permutation polytopes
|
Wednesday
|
|
|
Conference excursion
|
Thursday
|
|
10.00
|
Bruce Sagan: Patterns in partitions
|
11.00
|
Coffee
|
11.30
|
Aaron Jaggard: Prefix exchanging and pattern
avoidance by involutions
|
12.30
|
Lunch
|
2.00
|
Peter Hasto: The packing density of layered
permutations
|
3.00
|
Tea
|
3.30
|
Yuri Rabinovic: The algorithmic hardness of
the subpermutation problem
|
4.10
|
Problem session
|
Friday
|
|
10.00
|
Xavier Munoz: Fair ranking in dancesport competitions
|
10.30
|
Anant Godbole: Some contributions to the coupon
collector problem
|
11.00
|
Coffee
|
11.30
|
Yuri Rabinovic: SW conjecture: a dynamical
systems approach
|
12.10
|
Alex Burstein: Packing patterns into words
|