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 |

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

This spring I am teaching Elementary Number Theory (Math 310) 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

History of Mathematics Math 415

Abstract Algebra I, II Math 430-1

Advanced Linear Algebra Math 434

Putnam Problem Solving Seminar Math 485

Solitaire Mancala Games and the Chinese Remainder Theorem (with Laura Taalman and Anthony Tongen)

Permutations, Pattern Avoidance, and the Catalan Triangle (with Derek Desantis, Rebecca Field, Wesley Hough, Rebecca Meissen, and Jacob Ziefle)

Missouri Journal of Mathematical Sciences 25 (1) (2013) 50-60 preprint version

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.