16 citations · 42 across the 12 of their papers we have counts for
14 papers
Cycle systems, coparking functions, and h-vectors of matroids
Scott Corry, Anton Dochtermann, Solís McClain +2
The h-vector of a matroid M is an important invariant related to the independence complex of M and can also be recovered from an evaluation of its Tutte polynomial. A well-known co…
Counting weighted maximal chains in the circular Bruhat order
Gopal Goel, Olivia McGough, David Perkinson
The totally nonnegative Grassmannian is the subset of the real Grassmannian consisting of points with all nonnegative Plücker coordina…
Simplicial Dollar Game
Jesse Kim, David Perkinson
The dollar game is a chip-firing game introduced by Baker and Norine (2007) as a context in which to formulate and prove the Riemann-Roch theorem for graphs. A divisor on a graph i…
Enumerating linear systems on graphs
Sarah Brauner, Forrest Glebe, David Perkinson
The divisor theory of graphs views a finite connected graph as a discrete version of a Riemann surface. Divisors on are formal integral combinations of the vertices of ,…
Critical groups of iterated cones
Gopal Goel, David Perkinson
Let G be a finite graph, and let G_n be the n-th iterated cone over G. We study the structure of the critical group of G_n arising in divisor and sandpile theory.
Sandpiles, spanning trees, and plane duality
Melody Chan, Darren Glass, Matthew Macauley +3
Let G be a connected, loopless multigraph. The sandpile group of G is a finite abelian group associated to G whose order is equal to the number of spanning trees in G. Holroyd et a…