| 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 |
| 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 |
| 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 |
