I've mentored over 18 students majoring in math and computer science through various undergraduate research projects. 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. I frequently write computer programs to assist my mathematial work. I have also had a successful career outside the university, in software engineering and consulting. |

Some of my previous classes include:

Nature of Mathematics Math 103 |
Calculus III (Multivariable) Math 237 |
Graph Theory and Combinatorics Math 353 |
Advanced Linear Algebra Math 434 |

Calculus (with Functions) Math 231 |
Discrete Mathematics Math 245 |
History of Mathematics Math 415 |
Putnam Problem Solving Seminar Math 485 |

Calculus I, II Math 235-6 |
Elementary Number Theory Math 310 |
Abstract Algebra I, II Math 430-1 |

My present work usually involves undergraduates. If you are a student interested in algorithms/programming or mathematical research, feel free to send me an email. Most recently, I've been thinking about sequential decision making.

The library of papers is below. The ones marked with * are especially recommended for undergraduate readers.

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

* *The Refined Lecture Hall Theorem via Abacus Diagrams * (with Laura Bradford, Meredith Harris, Alex Komarinski, Carly Matson, and Edwin O'Shea)

* *Rational generating series for affine permutation pattern avoidance*

* *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.