معرفی
Jean-Luc Baril is a Professor of Computer Science at the University of Burgundy, affiliated with the LIB EA 7534 laboratory. His work bridges combinatorics and discrete mathematics, focusing on bijective, enumerative, and generative aspects of combinatorial structures.
- Research Interests: Catalan numbers, Dyck/Motzkin paths, permutation patterns, pattern avoidance, Gray codes.
- Collaborators: Sergey Kirgizov, José Ramírez, Mehdi Naima, Helmut Prodinger.
- Education: PhD in Pure Mathematics (University of Bordeaux, 1996), CAPES, and agrégation in Mathematics.
His research explores lattice structures on Dyck paths, knight's path enumeration, and bijections between polyominoes and compositions. He has developed interactive Java applets for visualizing Gray codes in restricted permutation classes related to Catalan, Schröder, and Fibonacci sequences.
The articles demonstrate a consistent focus on Catalan structures, path enumeration, and pattern avoidance in permutations and words. Recent works include lattice analysis (2025), Motzkin paths with air pockets (2024), and knight's path connections to Catalan numbers (2023).
