A generating tree with a single label for permutations avoiding the vincular pattern 1−32−4
Cervetti, Matteo
Uniform generation of infinite traces
Abbes, Samy, Jugé, Vincent
On the exhaustive generation of discrete figures with connectivity constraints
Tremblay, Hugo, Vernay, Julien
Combinatorial interpretation of Kazhdan–Lusztig basis elements indexed by 45312-avoiding permutations in 𝔖6
Datko, Ashton, Skandera, Mark
Foreword
Ferrari, Luca, Massazza, Paolo
On the strange kinetic aesthetic of rectangular shape partitions
Bodini, Olivier
Hermite-Hadamard’s inequalities for (h, r)-preinvex functions
Meftah, Badreddine, Souahi, Abdourazek
A q, r-analogue for the Stirling numbers of the second kind of Coxeter groups of type B
Bagno, Eli, Garber, David, Komatsu, Takao
From the Fibonacci to Pell numbers and beyond via Dyck paths
Barcucci, Elena, Bernini, Antonio, Pinzani, Renzo
On counting Z-convex polyominoes
Massazza, Paolo
Results of Hankel Semigroup of Linear Operator as Eventually Uniform Continuous Semigroup
Akinyele, Akinola Yussuff, Omosowon, Jude Babatunde, Aasa, Moses Adebowale, Ahmed, Bayo Musa, Bello, Kareem Akanbi
Asymptotic bit frequency in Fibonacci words
Baril, Jean-Luc, Kirgizov, Sergey, Vajnovszki, Vincent