Michael AlbertUniversity of OtagoSeparation anxiety
Dan ArchdeaconUniversity of Vermont
Mike AtkinsonUniversity of OtagoAvoiding consecutive patterns in permutations
Maia AverettMills College
Katherine Banks Harvard University
(ETSU REU participant)
Camillia Smith BarnesSweet Briar CollegeShuffles of permutations
Andrew Baxter Rutgers UniversitySome general results for even-Wilf-equivalence
Antonio Blanca Georgia Institute of Technology
(ETSU REU participant)
Jonathan Bloom Dartmouth CollegeAnother look at bijections for pattern-avoiding permutations
Mathilde Bouvel Université Paris 7 — Denis DiderotA polynomial algorithm for deciding the finiteness of the number of simple permutations in permutation classes
Robert BrignallUniversity of BristolAlmost exceptional simple permutations
Alex BursteinHoward University
David CallanUniversity of Wisconsin, MadisonA recurrence for (1−23−4)–avoiding permutations
Josef Cibulka Charles UniversityOn the size of sets of permutations with bounded VC-dimension
Anders ClaessonReykjavik UniversityExpanding permutation statistics as sums of permutation patterns
Danny Crytser Dartmouth College
Dan DalySoutheast Missouri State UniversityEnumerating permutations containing few copies of 321 and 3412
Eva Yuping DengDalian University of TechnologyPairings on bit strings
Michael Donders McDaniel College
(ETSU REU participant)
Adrian Duane UC, San DiegoGenerating functions for τ-matches
Mark DukesUniversity of IcelandComposition and partition matrices, bivincular patterns and (2+2)-free posets
Emilio ElizaldeInstitut de Ciències de l'Espai
Sergi ElizaldeDartmouth College
Shanzhen Gao Florida Atlantic UniversityCounting paths and walks with several step vectors
Anant GodboleEast Tennessee State University
Katherine Grzesik SUNY at Oswego
(ETSU REU participant)
Cheyne Homberger University of FloridaThe number of distinct minors of a permutation
Miles Jones UC, San DiegoPattern matching in the cycle structures of permutations
Matthieu Josuat-Vergès Université Paris-Sud 11Crossings and patterns in signed permutations
Jong Hyun Kim Brandeis University
Nan Li MIT
Jeff LieseCalifornia Polytechnic State UniversityGenerating 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 NovakUniversity of WaterlooAn asymptotic version of a theorem of Knuth
Rosa OrellanaDartmouth College
Greta Panova Harvard UniversitySeparable permutations, Robinson-Schensted and shortest containing supersequences
Kyoungsuk Park Ajou University
Adeline Pierrot Université Paris 7 — Denis DiderotThe simple permutation poset
Lara PudwellValparaiso UniversityPattern avoidance in Πn ∫ Ck
Don RawlingsCalifornia Polytechnic State UniversityConsecutive patterns: From permutations to column-convex polyominoes and back
Jeffrey RemmelUC San DiegoMinimal overlapping patterns
Manda RiehlUniversity of Wisconsin, Eau ClaireMaximally distant genomes under the DCJ operation
Paige Rinker Dartmouth College
Chelsea Ross East Tennessee State University
(ETSU REU participant)
Nik RuškucUniversity of St AndrewsGrid pattern classes
John SchmittMiddlebury College
Heather Shapell Arcadia University
(ETSU REU participant)
Brooks Smith Notre Dame
(ETSU REU participant)
Rebecca SmithSUNY Brockport
Richard StanleyMITProducts of cycles
Einar SteingrímssonReykjavik UniversityPermutation patterns and the Möbius function
Walter Stromquist
Mark Tiefenbruck UC, San Diego231-avoiding permutations and the Schensted correspondence
Nicholas Triantafillou University of Michigan
(ETSU REU participant)
Henning UlfarssonReykjavik UniversityDetecting singularities of Schubert varieties with permutation patterns
Vincent VatterDartmouth College
Chao-Jen Wang Brandeis University
Greg WarringtonUniversity of Vermont
Fan Wei MITThe weak Bruhat order and separable permutations
Julian WestUniversity of BristolPattern replacement and factor replacement
Pete WinklerDartmouth College
Taedong Yun MIT