<p>We introduce a new class of matroids, called <i>graph curve matroids</i>. 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-edge-connected and trivalent. These define <i>identically self-dual</i> graph curve matroids, but we also develop generalizations. Finally, we provide an implementation in <Emphasis FontCategory="NonProportional">Macaulay2</Emphasis> and data of examples.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Graph curve matroids

  • Alheydis Geiger,
  • Kevin Kühn,
  • Raluca Vlad

摘要

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-edge-connected and trivalent. These define identically self-dual graph curve matroids, but we also develop generalizations. Finally, we provide an implementation in Macaulay2 and data of examples.