REVIEW 2 cited by
Graph Curve Matroids
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
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.
Forward citations
Cited by 2 Pith papers
-
Hamiltonian connectivity of some base-cobase graphs
The base-cobase graph of the regular matroid R10 is bipartite, giving the first negative answer to the Farber-Richter-Shank Hamiltonian connectivity problem, while wheels and whirls are shown Hamiltonian connected; th...
-
Just Keep Prompting: Evaluating Repetitive Socratic Prompting in VLMs
Repeated conversational pressure destabilizes VLM video answers — correct answers regress, wrong ones sometimes recover, and models differ sharply in how they respond.
Discussion (0). Continue with ORCID to comment.