2000 character limit reached
An Algorithm for the Tropical Realizability Problem for Families of Curves (1803.04491v1)
Published 12 Mar 2018 in math.AG
Abstract: Given a tropical fan curve $\Sigma$ and a family of algebraic curves $X \rightarrow \mathbb{A}k$ we define the realization locus $\mathop{Real}\Sigma \subseteq \mathbb{A}k$ as the set of fibers $X_a$ whose tropicalization is $\Sigma$. We produce an algorithm that describes the Zariski closure of $\mathop{Real}\Sigma$ by imposing algebraic conditions for each ray of $\Sigma$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.