arXiv Analytics

Sign in

arXiv:2311.08332 [math.CO]AbstractReferencesReviewsResources

Graph Curve Matroids

Alheydis Geiger, Kevin Kuehn, Raluca Vlad

Published 2023-11-14Version 1

We introduce a new class of matroids, called graph curve matroids. A graph curve matroid is associated to a graph and defined on the vertices of the graph as a ground set. We prove that these matroids provide a combinatorial description of hyperplane sections of degenerate canonical curves in algebraic geometry. Our focus lies on graphs that are 2-connected and trivalent, which define identically self-dual graph curve matroids, but we also develop generalizations. Finally, we provide an algorithm to compute the graph curve matroid associated to a given graph, as well as an implementation and data of examples that can be used in Macaulay2.

Related articles: Most relevant | Search more
arXiv:1809.04690 [math.CO] (Published 2018-09-12)
Hyperplane Sections of Determinantal Varieties over Finite Fields and Linear Codes
arXiv:1605.06755 [math.CO] (Published 2016-05-22)
A combinatorial description of topological complexity for finite spaces
arXiv:2410.19454 [math.CO] (Published 2024-10-25)
On combinatorial descriptions of faces of the cone of supermodular functions