4 citations · 4 across the 5 of their papers we have counts for
5 papers · 1 filter
Equivariant Ehrhart Theory of Hypersimplices
Oliver Clarke, Max Kölbl
We study the hypersimplex under the action of the symmetric group by coordinate permutation. We prove that the evaluation of its equivariant -polynomial at is the pe…
On a Conjecture Concerning the Roots of Ehrhart Polynomials of Symmetric Edge Polytopes from Complete Multipartite Graphs
Max Kölbl
In [7], Higashitani, Kummer, and Michałek pose a conjecture about the symmetric edge polytopes of complete multipartite graphs and confirm it for a number of families in the bipart…
Diameter reduction via arc reversal
Panna Gehér, Max Kölbl, Lydia Mirabel Mendoza-Cadena +1
The diameter of a directed graph is the maximum distance between any pair of vertices. We study a problem that generalizes \textsc{Oriented Diameter}: For a given directed graph an…
Properties of Ehrhart Polynomials whose Roots Lie on the Critical Line
Max Kölbl
We study a class of polynomials that has all of its roots on the critical line and shares many properties with Ehrhart polynomials. Braun showed that the roots of Ehrhart polynomia…
Gorenstein graphic matroids from multigraphs
Max Kölbl
A matroid is Gorenstein if its toric variety is. Hibi, Lasoń, Matsuda, Michałek, and Vodička provided a full graph-theoretic classification of Gorenstein matroids associated to sim…