DeepAI AI Chat
Log In Sign Up

Computing zero-dimensional tropical varieties via projections

by   Paul Görlach, et al.

We present an algorithm for computing zero-dimensional tropical varieties using projections. Our main tools are fast unimodular transforms of lexicographical Gröbner bases. We prove that our algorithm requires only a polynomial number of arithmetic operations if given a Gröbner basis, and we demonstrate that our implementation compares favourably to other existing implementations. Applying it to the computation of general positive-dimensional tropical varieties, we argue that the complexity for calculating tropical links is dominated by the complexity of the Gröbner walk.


page 1

page 2

page 3

page 4


On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection

Given a zero-dimensional polynomial system consisting of n integer polyn...

Square-free Strong Triangular Decomposition of Zero-dimensional Polynomial Systems

Triangular decomposition with different properties has been used for var...

A New Type of Gröbner Basis and Its Complexity

The new type of ideal basis introduced herein constitutes a compromise b...

Solving p-adic polynomial systems via iterative eigenvector algorithms

In this article, we describe an implementation of a polynomial system so...

Threaded Gröbner Bases: a Macaulay2 package

The complexity of Gröbner computations has inspired many improvements to...

Dimensional Complexity and Algorithmic Efficiency

This paper uses the concept of algorithmic efficiency to present a unifi...

A Non-iterative Parallelizable Eigenbasis Algorithm for Johnson Graphs

We present a new O(k^2 nk^2) method for generating an orthogonal basis o...