Tropical bases by regular projections
Kerstin Hept, Thorsten Theobald

TL;DR
This paper improves the understanding of tropical varieties by showing that prime ideals have short tropical bases with bounded size, and provides a computational method to find these bases.
Contribution
It introduces a bound on the size of tropical bases for prime ideals and offers a computational approach to construct them.
Findings
Prime ideals have tropical bases of size at most r + codim I + 1.
The degree of basis elements may increase, but the basis remains short.
A computational method for constructing these bases is provided.
Abstract
We consider the tropical variety of a prime ideal generated by the polynomials and revisit the regular projection technique introduced by Bieri and Groves from a computational point of view. In particular, we show that has a short tropical basis of cardinality at most at the price of increased degrees, and we provide a computational description of these bases.
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 · Coding theory and cryptography
