research
2026
- Graded Ehrhart theory for hypersimplices2026Ehrhart theory counts lattice points in dilates of a polytope. Reiner and Rhoades conjectured a graded refinement, where that count is upgraded to a q-series coming from orbit harmonics. We prove rationality of this refinement for hypersimplices by writing down generators for the harmonics ideal, which as a bonus hands you the Hilbert series and the graded Frobenius characteristic. The combinatorial heart of it turns out to be a statement about 2-factors of regular multigraphs, and you can draw one to see the constructions run. The lattice-point counts underneath all of this are their own interactive page.
2025
- An elaborate new proof of Cayley’s formulaAlgebraic Combinatorics, 2025Cayley's formula says there are nn−2 labelled trees on n vertices, and it has a dozen proofs that fit on a postcard. Ours goes through Deodhar components of a braid variety built from an affine Kac–Moody group of type An−1, Opdam's trace formula in the affine Hecke algebra, and an identity of Haglund. The bijection is completely explicit, though, so you can watch it run on a tree you pick yourself.
- Rational Catalan numbers for complex reflection groupsJournal of Algebra, 2025Galashin, Lam, Trinh, and Williams proved the enumeration of noncrossing Catalan objects for finite Coxeter groups uniformly, by evaluating the canonical symmetrizing trace on the Hecke algebra at a power of a Coxeter element. This paper runs the same machine on the spetsial complex reflection groups — the ones that behave as though they were Weyl groups of a group that does not exist — and rational Catalan numbers come back out the other end. There is a demo that computes this trace explicitly.