معرفی
Jon Beagley is an Associate Professor of Mathematics and Statistics at Valparaiso University. He holds a Ph.D. (2013) and M.S. (2012) from George Mason University, and a B.S. (2008) from the Illinois Institute of Technology. His research focuses on combinatorics, graph theory, and convex geometries, with notable contributions to enumeration problems, geometric graph properties, and extremal combinatorics. He also investigates innovative teaching methods, such as cumulative homework and testing strategies in calculus education. His work bridges theoretical mathematics with pedagogical innovation.
Beagley’s research explores topics including Catalan numbers generalizations, chromatic properties of copoint graphs, and the interplay between convex geometries and order theory. His recent publications (2021) address colorful tilings and Christmas tree enumeration, showcasing both theoretical depth and accessible combinatorial problems. Earlier work (2013–2015) delves into semidefinite rank bounds and tableau inversions, reflecting expertise in algebraic combinatorics.
His teaching-focused articles (2016, 2020) evaluate cumulative assessment methods, emphasizing their impact on student performance and retention. Despite no listed awards, his contributions to undergraduate education and geometric combinatorics demonstrate sustained scholarly activity. Beagley maintains an active publication record since 2007, with ongoing work in mathematics education and discrete geometry.
