Since joining JMU, I've mentored undergraduate research projects for students majoring in math and computer science. In 2013, I was a visiting researcher in the semester program on Combinatorial Representation Theory at the Institute for Computational and Experimental Research in Mathematics (ICERM). In 2016, I was awarded a sabbatical semester and participated in the workshop on Polyhedral Geometry and Partition Theory at the American Institute of Mathematics (AIM). I currently serve as co-PI (with Anthony Tongen) for the grant that funds our department's summer NSF REU site.

My research interests include games, algorithms, algebraic structures, and enumerative combinatorics, particularly as related to the representation theory of reflection groups.
Teaching

Next semester I am teaching Graph Theory and Combinatorics (Math 353) and Discrete Structures (CS/Math 227).

Some of my previous classes include:

Nature of Mathematics Math 103

Calculus (with Functions) Math 231

Calculus I, II Math 235-6

Calculus III (Multivariable) Math 237

Discrete Mathematics Math 245

Elementary Number Theory Math 310

History of Mathematics Math 415

Abstract Algebra I, II Math 430-1

Advanced Linear Algebra Math 434

Putnam Problem Solving Seminar Math 485

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.