24 citations · 55 across the 26 of their papers we have counts for
31 papers
Matroids with cycle systems are regular
Anton Dochtermann, Evan Huang, Kai Mawhinney +2
A cycle system for a matroid is a collection of cycles (unions of circuits) whose intersection properties mimic the cut sets of a graph. Cycle systems were introduced by Corry,…
Chordality, syzygies, and shellability for hypergraphic analogues of interval graphs
Anton Dochtermann, Bennet Goeckner, Marta Pavelka
Interval graphs are a special class of chordal graphs, and hence have connections to commutative algebra via Fröberg's theorem that characterizes linear resolutions of squarefree q…
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…
Parking functions and chip-firing on hypergraphs
Timothy Blanton, Anton Dochtermann, Isabelle Hong +2
For a connected graph with sink vertex , a -parking function is a vector of nonnegative integers whose entries are determined by cut-sets in . Such objects also arise…
Shellability of the quotient order on lattice path matroids
Carolina Benedetti, Anton Dochtermann, Kolja Knauer +1
The concept of a matroid quotient has connections to fundamental questions in the geometry of flag varieties. In previous work, Benedetti and Knauer characterized quotients in the…
Simplicial complexes with many facets are vertex decomposable
Anton Dochtermann, Ritika Nair, Jay Schweig +2
Suppose is a pure simplicial complex on vertices having dimension and let be its codimension in the simplex. Terai and Yoshida proved that if the number of…