Using large random permutations to partition permutation classes
Bean, Christian, Nadeau, Émile, Pantone, Jay, Ulfarsson, Henning
From the Fibonacci to Pell numbers and beyond via Dyck paths
Barcucci, Elena, Bernini, Antonio, Pinzani, Renzo
A q, r-analogue for the Stirling numbers of the second kind of Coxeter groups of type B
Bagno, Eli, Garber, David, Komatsu, Takao
Foreword
Ferrari, Luca, Massazza, Paolo
Combinatorial interpretation of Kazhdan–Lusztig basis elements indexed by 45312-avoiding permutations in 𝔖6
Datko, Ashton, Skandera, Mark
On counting Z-convex polyominoes
Massazza, Paolo
A generating tree with a single label for permutations avoiding the vincular pattern 1−32−4
Cervetti, Matteo
Enumeration of S-Motzkin paths from left to right and from right to left: a kernel method approach
Prodinger, Helmut
New degenerate Bernoulli, Euler, and Genocchi polynomials
Herscovici, Orli, Mansour, Toufik
Volume 29 (2020): Issue 1 (December 2020)
Varga, Zoltán
Counting Stirling permutations by number of pushes
Mansour, Toufik, Shattuck, Mark
On the largest part size and its multiplicity of a random integer partition
Mutafchiev, Ljuben