Program | Submission | Registration |

Committees | Participants | Local Info |

Travel to Dijon | Accommodations | Travel Support |

Social | Booklet | Photos |

Please find below the schedule and the list of speakers. Green slots represent 20-25 minutes regular presentations.

Click here to download a pdf version of the schedule.

Monday | Tuesday | Wednesday | Thursday | Friday | |
---|---|---|---|---|---|

3 July | 4 July | 5 July | 6 July | 7 July | |

9:00-9:30 | Regist & welcome | Ramírez | Corsini | Weiner | |

9:30-10:00 | Bevan | Williams | Adenbaum | Kirgizov | Slivken |

10:00-10:30 | Asinowski | Smith | Bean | Price | Troyka |

10:30-11:00 | Coffee break | Coffee break | Coffee break | Coffee break | Coffee break |

11:00-11:30 | Testart | Pantone | Problem session | Mütze | Jones |

11:30-12:00 | Yıldırım | Opler | |||

Conference Photo | Next PP and closing | ||||

Lunch break | Lunch break | Lunch break | Lunch break | ||

14:00-14:30 | Henriet | Dukes | Cultural visit | Deb | |

14:30-15:00 | Vatter | Cerbai | Sagan | ||

15:00-15:30 | Coffee break | Coffee break | Coffee break | ||

15:30-16:00 | Jarvis | Naima | Hämäläinen | ||

16:00-16:30 | Brignall | Ulfarsson | Bouvel | ||

16:30-17:00 | First poster session | Blanco | Second poster session | ||

17:00-17:30 | |||||

19:00- | Banquet |

### KEYNOTE SPEAKERS

Torsten Mütze | Efficient algorithms for generating pattern-avoiding combinatorial objects |

Jay Pantone | Computational and experimental methods in permutation patterns |

### 20-25 minutes TALKS

Ben Adenbaum | Rowmotion on 321-avoiding permutations |

Andrei Asinowski | Guillotine rectangulations and mesh patterns |

Christian Bean | Permutations avoiding bipartite partially ordered patterns have a regular insertion encoding |

David Bevan | Mesh patterns in random permutations |

Saúl A. Blanco | Enumerating grid signed permutation classes |

Mathilde Bouvel | Baxter tree-like tableaux |

Robert Brignall | Uncountably many well-quasi-ordered permutation classes |

Giulio Cerbai | Fishburn trees |

Benoit Corsini | Mallows processes and the expanded hypercube |

Bishal Deb | Continued fractions using a Laguerre digraph interpretation of the Foata–Zeilberger bijection and its variants |

Mark Dukes | Weak ascent sequences, permutations, matrices, and posets |

Rimma Hämäläinen | On the Erdős-Szekeres problem for convex permutations and orthogonally convex point sets |

Corentin Henriet | From two-stack sortable permutations to fighting fish |

Ben Jarvis | On permutation classes defined by pin sequences |

Miles Jones | Evolutionary permutations |

Sergey Kirgizov | Sturm meets Fibonacci in Minkowski’s fractal bar |

Mehdi Naima | Increasing Schröder trees and restricted permuta |

Michal Opler | Monadic second-order logic of permutations |

Andrew Elvey Price | Combinatorial Stieltjes moment sequences |

Jose Ramírez | Descent distribution on Catalan words avoiding ordered pairs of relations |

Bruce Sagan | Cyclic shuffle-compatibility |

Erik Slivken | Permutation limit of 1342-avoiding permutations |

Rebecca Smith | Pattern avoidance in alternating sign matrices |

Benjamin Testart | Inversion sequences avoiding pairs of patterns |

Justin Troyka | Growth rates of permutations with a given descent set |

Henning Ulfarsson | Counting permutations by inversions |

Vincent Vatter | Sorting with restricted containers |

Michael Weiner | A positional statistic for 1324-avoiding permutations |

Aaron Williams | Pattern avoidance for k-Catalan sequences |

Gökhan Yıldırım | Inversion sequences avoiding 021 and a five-letter pattern |

### FIRST POSTER SESSION

Amrita Acharyya | An analougue of chain-permutational poset |

Eli Bagno | Block-wise simple permutations |

Gi-Sang Cheon | The operad structures of poset matrices associated to natural partial ordering |

David Garber | A q,r-analogue of Stirling numbers of type B of the first kind |

Chetak Hossain | A bijective proof of a special case of an equidistribution conjecture |

Krishna Menon | Occurrences of subsequences in binary words |

Jonathan Michala | Characterizing Rothe diagrams |

GaYee Park | On the Rajchgot index of permutations |

Eric Redmon | Insertion encodings and bounded families |

Daniel Threlfall | Thresholds for patterns in random permutations |

Omar Tout | Generalized characters of the generalized symmetric group |

Michael Wallner | Dyck paths and inversion tables |

### SECOND POSTER SESSION

Stefano Bilotta | Restricted permutations and bounded Dyck paths |

William Clark | Descent statistics with the M-binomial property |

Nestor Diaz Morera | Spherical Dyck paths |

Jennifer Elder | On flattened parking functions |

Kimberly Harry | Flattened Stirling permutations and type B set partitions |

Jan Kretschmann | Counting parking sequences and parking assortments through permutations |

Alexandros Singh | Patterns in trivalent maps and normalisation of linear λ-terms |

Anurag Singh | Grassmannian permutations avoiding identity |

Keegan Stump | Bijective proofs of shuffle-compatibility for colored descentstatistics |