Since joining JMU, I've mentored several undergraduate research projects for students majoring in math and computer science, both locally as well as part of the NSF REU site that we host during the summer. In 2013, I was invited to participate as a visiting researcher in the semester program on Combinatorial Representation Theory at the Institute for Computational and Experimental Research in Mathematics (ICERM).
My research interests include algorithms, algebraic structures, and enumerative combinatorics, particularly as related to the representation theory of reflection groups.
Teaching
I have been awarded a sabbatical semester for Fall 2016. Some of my previous classes include:
Nature of Mathematics Math 103
Discrete Structures CS/Math 227
Calculus (with Functions) Math 231
Calculus I Math 235
Calculus II Math 236
Calculus III (Multivariable) Math 237
Discrete Mathematics Math 245
History of Mathematics Math 415
Abstract Algebra I Math 430
Abstract Algebra II Math 431
Advanced Linear Algebra Math 434
Putnam Problem Solving Seminar Math 485 (usually with Dr. Rebecca Field)
Some Papers Especially For or By Undergraduate Researchers
Rational generating series for affine permutation pattern avoidance
Sage: I have contributed some code to sage.combinat, particularly an initial implementation of the Lenart--Postnikov alcove path model for crystals.
liberiksson: A C++ library to perform fast computations on elements of Coxeter groups, used for some of my papers on Kazhdan--Lusztig polynomials. More specifically, the code classifies the Deodhar elements of finite Coxeter groups by embedded factor containment, and verifies that the mu coefficients for Kazhdan--Lusztig polynomials associated to these elements are always 0 or 1.