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
Some Papers Especially For or By Undergraduate Researchers
Rational generating series for affine permutation pattern avoidance
The Refined Lecture Hall Theorem via Abacus Diagrams (with Laura Bradford, Meredith Harris, Alex Komarinski, Carly Matson, and Edwin O'Shea)
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)
Additional Publications (with descriptions)
Results and conjectures on simultaneous core partitions (with Drew Armstrong and Christopher R. H. Hanusa)
Using carry-truncated addition to analyze add-rotate-xor hash algorithms (with Rebecca Field)
Mask formulas for cograssmannian Kazhdan--Lusztig polynomials (with Alexander Woo)
Abacus models for parabolic quotients of affine Weyl groups (with Christopher R. H. Hanusa)
Affine structures and a tableau model for E6 crystals (with Anne Schilling)
The enumeration of maximally clustered permutations (with Hugh Denoncourt)
The enumeration of fully commutative affine permutations (with Christopher R. H. Hanusa)
An explicit derivation of the Möbius function for Bruhat order
A bijection on core partitions and a parabolic quotient of the affine symmetric group (with Chris Berg and Monica Vazirani)
Leading coefficients of Kazhdan--Lusztig polynomials for Deodhar elements
Kazhdan--Lusztig polynomials for maximally-clustered hexagon-avoiding permutations
Embedded factor patterns for Deodhar elements in Kazhdan-Lusztig theory (with Sara C. Billey)
: I have contributed some code to sage.combinat
, particularly an initial implementation of the Lenart--Postnikov alcove path model for crystals.
: 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.