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

Teaching

This semester I am teaching History of Mathematics (Math 415) and Discrete Structures (CS/Math 227).

Some of my previous classes include:

Nature of Mathematics Math 103

Calculus III (Multivariable) Math 237

Graph Theory and Combinatorics Math 353

Putnam Problem Solving Seminar Math 485

Calculus (with Functions) Math 231

Discrete Mathematics Math 245

Abstract Algebra I, II Math 430-1

Calculus I, II Math 235-6

Elementary Number Theory Math 310

Advanced Linear Algebra Math 434

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.