Permutation Patterns 2010

Participants

Michael Albert	University of Otago	Separation anxiety
Dan Archdeacon	University of Vermont
Mike Atkinson	University of Otago	Avoiding consecutive patterns in permutations
Maia Averett	Mills College
Katherine Banks	Harvard University (ETSU REU participant)
Camillia Smith Barnes	Sweet Briar College	Shuffles of permutations
Andrew Baxter	Rutgers University	Some general results for even-Wilf-equivalence
Antonio Blanca	Georgia Institute of Technology (ETSU REU participant)
Jonathan Bloom	Dartmouth College	Another look at bijections for pattern-avoiding permutations
Mathilde Bouvel	Université Paris 7 — Denis Diderot	A polynomial algorithm for deciding the finiteness of the number of simple permutations in permutation classes
Robert Brignall	University of Bristol	Almost exceptional simple permutations
Alex Burstein	Howard University
David Callan	University of Wisconsin, Madison	A recurrence for (1−23−4)–avoiding permutations
Josef Cibulka	Charles University	On the size of sets of permutations with bounded VC-dimension
Anders Claesson	Reykjavik University	Expanding permutation statistics as sums of permutation patterns
Danny Crytser	Dartmouth College
Dan Daly	Southeast Missouri State University	Enumerating permutations containing few copies of 321 and 3412
Eva Yuping Deng	Dalian University of Technology	Pairings on bit strings
Michael Donders	McDaniel College (ETSU REU participant)
Adrian Duane	UC, San Diego	Generating functions for τ-matches
Mark Dukes	University of Iceland	Composition and partition matrices, bivincular patterns and (2+2)-free posets
Emilio Elizalde	Institut de Ciències de l'Espai
Sergi Elizalde	Dartmouth College
Shanzhen Gao	Florida Atlantic University	Counting paths and walks with several step vectors
Anant Godbole	East Tennessee State University
Katherine Grzesik	SUNY at Oswego (ETSU REU participant)
Cheyne Homberger	University of Florida	The number of distinct minors of a permutation
Miles Jones	UC, San Diego	Pattern matching in the cycle structures of permutations
Matthieu Josuat-Vergès	Université Paris-Sud 11	Crossings and patterns in signed permutations
Jong Hyun Kim	Brandeis University
Nan Li	MIT
Jeff Liese	California Polytechnic State University	Generating functions for Wilf equivalence under generalized factor order
Chang Mou Lim	Yale University (ETSU REU participant)
Palmer Mebane	Harvey Mudd College (ETSU REU participant)
Brian Nakamura	Rutgers University
Jonathan Novak	University of Waterloo	An asymptotic version of a theorem of Knuth
Rosa Orellana	Dartmouth College
Greta Panova	Harvard University	Separable permutations, Robinson-Schensted and shortest containing supersequences
Kyoungsuk Park	Ajou University
Adeline Pierrot	Université Paris 7 — Denis Diderot	The simple permutation poset
Lara Pudwell	Valparaiso University	Pattern avoidance in Π_n ∫ C_k
Don Rawlings	California Polytechnic State University	Consecutive patterns: From permutations to column-convex polyominoes and back
Jeffrey Remmel	UC San Diego	Minimal overlapping patterns
Manda Riehl	University of Wisconsin, Eau Claire	Maximally distant genomes under the DCJ operation
Paige Rinker	Dartmouth College
Chelsea Ross	East Tennessee State University (ETSU REU participant)
Nik Ruškuc	University of St Andrews	Grid pattern classes
John Schmitt	Middlebury College
Heather Shapell	Arcadia University (ETSU REU participant)
Brooks Smith	Notre Dame (ETSU REU participant)
Rebecca Smith	SUNY Brockport
Richard Stanley	MIT	Products of cycles
Einar Steingrímsson	Reykjavik University	Permutation patterns and the Möbius function
Walter Stromquist
Mark Tiefenbruck	UC, San Diego	231-avoiding permutations and the Schensted correspondence
Nicholas Triantafillou	University of Michigan (ETSU REU participant)
Henning Ulfarsson	Reykjavik University	Detecting singularities of Schubert varieties with permutation patterns
Vincent Vatter	Dartmouth College
Chao-Jen Wang	Brandeis University
Greg Warrington	University of Vermont
Fan Wei	MIT	The weak Bruhat order and separable permutations
Julian West	University of Bristol	Pattern replacement and factor replacement
Pete Winkler	Dartmouth College
Taedong Yun	MIT