Plenary talks
- David Bevan, Monotone Grid Classes: Limit Shapes and Enumeration
In this talk, we will consider the following questions:
- What does a typical large permutation in a given monotone grid class look like? That is, what is the limit shape of the class?
- What is known (and what is not known) about the enumeration (exact and asymptotic) of monotone grid classes?
Full abstract
- Natisha Blitvic, tba
Talks
- Aaron Williams, Exhaustive Generation of Pattern-Avoiding s-Words
- Abigail Ollson, The insertion encoding of Cayley permutations
- Alexander Burstein, Wilf equivalence of partial permutations
- Alperen Ozdemir, Logic of 321-avoiding permutations and random processes
- Anant Godbole, Proofs of Two Conjectures Mentioned in Moscow, USA
- Andrei Asinowski, \(\top\)-avoiding rectangulations and I(010,101,120,201) \(\cong\) I(011,201)
- Ben Jarvis, Factorial Languages with applications to \(\mathcal{V}\)-antichains.
- Benjamin Testart, Inversion sequences avoiding 021 and other patterns
- David Garber, Pattern avoidance in restricted-growth words of type \(B\)
- Emil Verkama, Enumerating 1324-avoiders with few inversions
- Jay Pantone, Counting permutation classes quickly using tilings
- Joshua Arroyo, Permutations with only reduced co-BPDs
- Juan Gil, Positional statistics for separable permutations
- Justin Troyka, Every pattern-avoiding class of Catalan words has a rational generating function
- Krishna Menon, Topology of Permutation Patterns
- Kyle Celano, On inversions, major index, and the area statistic on \(\ell\)-interval parking functions
- Mathilde Bouvel, Between weak and Bruhat: the middle order on permutations
- Matthew Slattery-Holmes, Extensions to Wilf-Equivalences among Partial Shuffles
- Michaela Polley, Characterization of Avoidance of One-Sided 2- and 3- Segment Patterns in Rectangulations by Mesh Patterns
- Michal Opler, An Optimal Algorithm for Sorting Pattern-Avoiding Sequences
- Nathanaël Hassler, Emerging consecutive pattern avoidance
- Radek Hušek, Enumerating grid classes using MSOL
- Rebecca Smith, Sorting permutations using a pop stack with a bypass
- Robert Brignall, Finitely based classes below 2.618 are rational
- Sergi Elizalde, Descents of permutations with only even or only odd cycles
- Thomas Muller, Higher dimensional floorplans and Baxter d-permutations
- Valentin Feray, Patterns in meandric systems and tree-indexed sums of Catalan numbers
- Victoria Ironmonger, The well quasi-order problem for combinatorial structures under the consecutive order
- Vince Vatter, Geometric grid classes and lettericity
- Walter Stromquist, Joint Packing Densities and the Great Limit Shape