Abstract

In this paper we study algorithmic aspects of tropical intersection theory. We analyze how divisors and intersection products on tropical cycles can actually be computed using polyhedral geometry. The main focus of this paper is the study of moduli spaces, where the underlying combinatorics of the varieties involved allow a much more efficient way of computing certain tropical cycles. The algorithms discussed here have been implemented in an extension for polymake, a software for polyhedral computations.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call