An Algorithm for the Tropical Realizability Problem for Families of Curves
Paolo Tripoli

TL;DR
This paper introduces an algorithm to determine the algebraic conditions under which a family of algebraic curves tropicalizes to a given tropical fan curve, aiding in solving the tropical realizability problem.
Contribution
The paper presents the first algorithmic approach to describe the Zariski closure of the realization locus for tropical fan curves within algebraic families.
Findings
Algorithm effectively computes algebraic conditions for tropicalization.
Provides a systematic method to describe the realization locus.
Advances understanding of tropical realizability in algebraic geometry.
Abstract
Given a tropical fan curve and a family of algebraic curves we define the realization locus as the set of fibers whose tropicalization is . We produce an algorithm that describes the Zariski closure of by imposing algebraic conditions for each ray of .
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
TopicsPolynomial and algebraic computation · Algebraic Geometry and Number Theory · Commutative Algebra and Its Applications
