I am currently an assistant professor at North Carolina State University. Previously I was a T. H. Hildebrandt Research Assistant Professor at the University of Michigan, Ann Arbor and an NSF postdoctoral fellow at the University of Minnesota, Twin Cities. I completed my Ph.D. at the Massachusetts Institute of Technology under the guidance of Alexander Postnikov in 2010. (CV)
My research interests lie in algebraic combinatorics, especially its relationship to algebraic geometry, combinatorial geometry, and representation theory. I am currently funded by a grant from the National Science Foundation, DMS-1700302.
We investigate the power of $2$ that divides the number of perfect matchings of a graph. In particular, we give a fast algorithm for determining whether the number of domino tilings of a simply connected planar region is even or odd based on billiard paths.
We give a complete list of relations between Schur operators $u_i$, which act on partitions by adding a box to column $i$ (if possible).
We show that twisted Schubert polynomials defined by $\widetilde{\mathfrak S}_{w_0} = x_1^{n-1}x_2^{n-2} \cdots x_{n-1}$ and $\widetilde{\mathfrak S}_{ws_i} = (s_i + \partial_i) \widetilde{\mathfrak S}_w$ are monomial positive. We also show how skew divided difference operators can be used to prove the Pieri rule for Schubert polynomials.
We show that Gelfand-Tsetlin polytopes can be expressed as flow polytopes. We also generalize this result to certain marked order polytopes of strongly planar posets.
We show how to construct a polytope whose integer point transform projects to the Schubert polynomial $\mathfrak S_w$ if $w$ has a column-convex Rothe diagram.
We prove that the $P$-partition generating function of a connected, naturally labeled poset is irreducible. We also give a rule for the expansion of a $P$-partition generating function into type 1 quasisymmetric power sums that generalizes the Murnaghan-Nakayama rule.
We discuss conditions under which two naturally labeled posets can have the same partition generating function.
We consider a generalization of Haglund's formula for the Hilbert series of the space of diagonal harmonics as a sum over Tesler matrices by summing over flow polytopes of threshold graphs.
We show how the theory of noncommutative super Schur functions (based on work of Fomin and Greene) gives a combinatorial formula for the Kronecker coefficient $g_{\lambda\mu\nu}$ when $\mu$ is a hook.
We give a simple combinatorial rule for the Kronecker coefficient $g_{\lambda\mu\nu}$ when $\mu$ is a hook.
We define subalgebras of the Fomin-Kirillov algebra for any finite graph and show that they have a surprising number of nice properties analogous to those of Coxeter groups and nil-Coxeter algebras. We explicitly compute the Hilbert series for the subalgebras corresponding to the Dynkin diagrams $A_n$, $D_n$, $E_n$ ($n=6,7,8$), and $\tilde A_{n-1}$.
We prove that the commutative quotient of the Fomin-Kirillov algebra of a graph $G$ on $n$ vertices is isomorphic to the Orlik-Terao algebra of $G$. In particular, its Hilbert series is $(-t)^n \cdot \chi_G(-t^{-1})$, where $\chi_G(t)$ is the chromatic polynomial of $G$.
We give a combinatorial criterion for when the Specht module of an arbitrary diagram admits a (complete) branching rule. We also show that the only relations in such Specht modules are given by generalized Garnir relations.
We give a positive formula for the skew divided difference operators (defined by Macdonald) in terms of divided difference operators $\partial_{ij}$ with $i < j$, settling a conjecture of Kirillov.
We give an explicit description of the coefficients of $(1-x)\Phi_{pqr}(x)$. We also define an analogous polynomial for any number of primes and describe their coefficients and growth rate as the number of primes increases.
We give a simple proof of a result of Erman, Smith, and Várilly-Alvarado relating Laurent polynomials and Eulerian numbers using Bernstein's theorem. We also show that a refinement of the Eulerian numbers gives a combinatorial interpretation for volumes of certain (rational) hyperplane sections of the hypercube.
We show that the set of hypergraph degree sequences is not the intersection of a lattice and a convex polytope. We also prove an analogous result for multipartite hypergraphs.
We prove that the normalized volume of the matching polytope of a forest equals the dimension of the corresponding Specht module. We also give $S_n$- and $GL_n$-branching rules, thereby defining a notion of Schur functions and standard/semistandard tableaux for forests.
We study the number of matrices of a given rank with specified zero entries over a finite field. We show that these numbers give a $q$-analogue of certain restricted permutations and obtain explicit $q$-analogues for derangement numbers. We also consider the analogous questions for symmetric and skew-symmetric cases and discuss related questions.
We present a conjecture relating the cohomology class of certain subvarieties of the Grassmannian to the structure of certain representations of the symmetric group and give evidence towards this conjecture.
We give a Littlewood-Richardson rule based on iteratively deforming a skew Young diagram into a straight shape. This rule is based on a geometric rule by Izzet Coskun.
We consider the problem of counting subrings of $\mathbf Z^n$ of a given index $k$. We show that a decomposition theorem holds and give a precise result when $n$ is at most 4 or $k$ is not divisible by the sixth power of any prime.
At North Carolina State University, I will be teaching the following course in Spring 2020:
Previously, I taught the following courses:
At the University of Michigan, I taught the following courses:
In Fall 2009, I was a teaching assistant for 18.02: Multivariable Calculus at MIT.
I have been an instructor at the Mathematical Olympiad Summer Program since 2007. I was also a research adviser at Joe Gallian's Research Experience for Undergraduates at the University of Minnesota, Duluth for the summers 2006–2008.