A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids

DOI10.1016/J.JCTA.2024.105891arXiv2204.12419MaRDI QIDQ6505809FDOQ6505809

Abstract: We define the root polytope of a regular oriented matroid, and show that the greedoid polynomial of an Eulerian branching greedoid rooted at vertex

v_{0}

is equivalent to the

h^{*}

-polynomial of the root polytope of the dual of the graphic matroid. As the definition of the root polytope is independent of the vertex

v_{0}

, this gives a geometric proof for the root-independence of the greedoid polynomial for Eulerian branching greedoids, a fact which was first proved by Swee Hong Chan, and K'evin Perrot and Trung Van Pham using sandpile models. We also obtain that the greedoid polynomial does not change if we reverse each edge of an Eulerian digraph.

Mathematics Subject Classification ID

Graph polynomials (05C31) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Oriented matroids in discrete geometry (52C40)

This page was built for publication: A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6505809)