Fundamentals of Computational Methods for Engineers
Rana, Masud, Xu, Wei, Guo, Youguang
Using large random permutations to partition permutation classes
Bean, Christian, Nadeau, Émile, Pantone, Jay, Ulfarsson, Henning
Asymptotic bit frequency in Fibonacci words
Baril, Jean-Luc, Kirgizov, Sergey, Vajnovszki, Vincent
Combinatorial interpretation of Kazhdan–Lusztig basis elements indexed by 45312-avoiding permutations in 𝔖6
Datko, Ashton, Skandera, Mark
A generating tree with a single label for permutations avoiding the vincular pattern 1−32−4
Cervetti, Matteo
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
On counting Z-convex polyominoes
Massazza, Paolo
On the exhaustive generation of discrete figures with connectivity constraints
Tremblay, Hugo, Vernay, Julien
Enumeration of rooted 3-connected bipartite planar maps
Noy, Marc, Requilé, Clément, Rué, Juanjo
On the strange kinetic aesthetic of rectangular shape partitions
Bodini, Olivier
Foreword
Ferrari, Luca, Massazza, Paolo