معرفی
Christian Bean is a Lecturer in Mathematics at Keele University, joining in 2023. Previously, he held postdoctoral positions at Reykjavik University (Iceland) from 2020 and LIPN, Université Paris Nord (France) in 2019. He earned his PhD in Computer Science from Reykjavik University in 2018 under Henning Ulfarsson. His research focuses on enumerative combinatorics and algorithmic methods for proving mathematical statements, particularly in permutation patterns and combinatorial structures. Key areas include permutation enumeration, pattern avoidance, and algorithmic frameworks for combinatorial exploration.
Bean has authored/co-authored influential papers in journals like The Electronic Journal of Combinatorics, Information and Computation, and Journal of Symbolic Computation, with recent work emphasizing insertion encodings, mesh patterns, and generating functions for Motzkin paths. His Combinatorial Exploration framework has become a cornerstone in algorithmic enumeration.
Supervision includes current PhD student Abigail Ollson and past MSc/BSc advisees. Active in academic collaboration, his work bridges theoretical computer science and discrete mathematics, with applications to structural analysis and automated discovery in combinatorial domains.
