Minimal generators of toric ideals of graphs
Enrique Reyes, Christos Tatakis, Apostolos Thoma

TL;DR
This paper characterizes key types of binomials in the toric ideal of a graph using graph theory, providing a clearer understanding of their structure and properties.
Contribution
It offers a graph-theoretic characterization of primitive, minimal, indispensable, and fundamental binomials in toric ideals of graphs, advancing the theoretical understanding.
Findings
Characterization of primitive binomials in graph terms
Identification of minimal and indispensable binomials
Clarification of fundamental binomials in toric ideals
Abstract
Let be the toric ideal of a graph . We characterize in graph theoretical terms the primitive, the minimal, the indispensable and the fundamental binomials of the toric ideal .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Cholinesterase and Neurodegenerative Diseases
