Program

Nik Ruškuc and Richard P. Stanley will deliver hour-long plenary talks.

Contributed talks will be 30 minutes, followed by 5 minutes for questions and a 5 minute break. You may also view a full list of participants.

The banquet will be held on Wednesday evening, at the DOC House on Occom Pond.

Sunday, August 8
12:00–6:00		Registration
6:00–8:30		Welcome reception and registration in Kemeny Hall
8:30–		After the welcome reception, participants staying in the dorms should phone (603) 443-3148 upon arrival
Monday, August 9
8:30–9:30		Continental breakfast
9:30–10:00	Einar Steingrímsson	Permutation patterns and the Möbius function
10:10–10:40	Cheyne Homberger	The number of distinct minors of a permutation
10:50–11:20		Refreshments
11:20–11:50	Jonathan Bloom	Another look at bijections for pattern-avoiding permutations
12:00–12:30	Mike Atkinson	Avoiding consecutive patterns in permutations
12:40–2:00		Lunch
2:00–2:30	Matthieu Josuat-Vergès	Crossings and patterns in signed permutations
2:40–3:10	Fan Wei	The weak Bruhat order and separable permutations
3:20–3:50		Refreshments
3:50–4:20	David Callan	A recurrence for (1−23−4)–avoiding permutations
4:30–5:00	Anders Claesson	Expanding permutation statistics as sums of permutation patterns
5:10–5:40	Lara Pudwell	Pattern avoidance in Πn ∫ Ck
Tuesday, August 10
8:30–9:30		Continental breakfast
9:30–10:00	Mark Tiefenbruck	231-avoiding permutations and the Schensted correspondence
10:10–10:40	Henning Ulfarsson	Detecting singularities of Schubert varieties with permutation patterns
10:50–11:20		Refreshments
11:20–12:20	Richard Stanley	Products of cycles
12:40–2:00		Lunch
2:00–2:30	Greta Panova	Separable permutations, Robinson-Schensted and shortest containing supersequences
2:40–3:10	Jonathan Novak	An asymptotic version of a theorem of Knuth
3:20–3:50		Refreshments
3:50–4:20	Adeline Pierrot	The simple permutation poset
4:30–5:00	Mathilde Bouvel	A polynomial algorithm for deciding the finiteness of the number of simple permutations in permutation classes
5:10–5:40	Robert Brignall	Almost exceptional simple permutations
Wednesday, August 11
8:30–9:30		Continental breakfast
9:30–10:00	Miles Jones	Pattern matching in the cycle structures of permutations
10:10–10:40	Don Rawlings	Consecutive patterns: From permutations to column-convex polyominoes and back
10:50–11:20		Refreshments
11:20–12:20	Nik Ruškuc	Grid pattern classes
12:40–2:00		Lunch
2:00–2:30	Jeff Liese	Generating functions for Wilf equivalence under generalized factor order
2:40–3:10	Josef Cibulka	On the size of sets of permutations with bounded VC-dimension
3:20–3:50		Refreshments
3:50–4:20	Jeffrey Remmel	Minimal overlapping patterns
4:30–5:00	Camillia Smith Barnes	Shuffles of permutations
5:10–5:40	Michael Albert	Separation anxiety
6:00–9:00		Banquet at DOC House
Thursday, August 12
8:30–9:30		Continental breakfast
9:30–10:00	Dan Daly	Enumerating permutations containing few copies of 321 and 3412
10:10–10:40	Shanzhen Gao	Counting paths and walks with several step vectors
10:50–11:20		Refreshments
11:20–11:50	Manda Riehl	Maximally distant genomes under the DCJ operation
12:00–12:30		Problem session
12:40–		Lunch & excursion
Friday, August 13
8:30–9:30		Continental breakfast
9:30–10:00	Mark Dukes	Composition and partition matrices, bivincular patterns and (2+2)-free posets
10:10–10:40	Adrian Duane	Generating functions for τ-matches
10:50–11:20		Refreshments
11:20–11:50	Andrew Baxter	Some general results for even-Wilf-equivalence
12:00–2:00		Lunch
2:00–2:30	Eva Yuping Deng	Pairings on bit strings
2:40–3:10	Julian West	Pattern replacement and factor replacement
3:20–5:00		BBQ in Kemeny Hall courtyard
Saturday, August 14
11:00		Check out time for dorms (leave keys in the key drop off box)