Much information about a graph can be obtained by studying its spanning trees. On the
other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question …

There is a well-established dictionary between zonotopes, hyperplane arrangements, and
their (oriented) matroids. Arguably one of the most famous examples is the class of graphical …

The smallest part is a rational function. This result is similar to the closely related case of
partitions with fixed differences between largest and smallest parts which has recently been …

First of all, I am grateful to my advisor Matthew Baker for providing me a tremendous amount
of support and advice throughout my graduate years. He has introduced me to many …

In this note we prove that the product of two arithmetic multiplicity functions on a matroid is
again an arithmetic multiplicity function. This allows us to answer a question by Bajo …

In this expository article we give an introduction to Ehrhart theory, ie, the theory of integer
points in polyhedra, and take a tour through its applications in enumerative combinatorics …

In this paper we address two of the major foundational questions in the theory of matroids
over rings. First, we provide a cryptomorphic axiomatisation, by introducing an analogue of …

In this note we provide a higher-dimensional analogue of Tutte's celebrated theorem on
colorings and flows of graphs, by showing that the theory of arithmetic Tutte polynomials and …

Let P be a locally finite poset with the interval space Int (P), and R be a ring with identity. We
shall introduce the Möbius conjugation μ⁎ sending each function f: P→ R to an incidence …

In this note we generalize the convolution formula for the Tutte polynomial of Kook, Reiner,
and Stanton and of Etienne and Las Vergnas to a more general setting that includes both …