DeepAI AI Chat
Log In Sign Up

Decomposing tropical rational functions

by   Dima Grigoriev, et al.
University of Lille

An algorithm is designed which decomposes a tropical univariate rational function into a composition of tropical binomials and trinomials. When a function is monotone, the composition consists just of binomials. Similar algorithms are designed for decomposing tropical algebraic rational functions being (in the classical language) piece-wise linear functions with rational slopes of their linear pieces. In addition, we provide a criterion when the composition of two tropical polynomials commutes (for classical polynomials a similar question was answered by J. Ritt).


page 1

page 2

page 3

page 4


Bivariate Extensions of Abramov's Algorithm for Rational Summation

Abramov's algorithm enables us to decide whether a univariate rational f...

Taylor Polynomials of Rational Functions

A Taylor variety consists of all fixed order Taylor polynomials of ratio...

Fast linear barycentric rational interpolation for singular functions via scaled transformations

In this paper, applied strictly monotonic increasing scaled maps, a kind...

The range of non-linear natural polynomials cannot be context-free

Suppose that some polynomial f with rational coefficients takes only nat...

Predictors for high frequency processes based on rational polynomials approximation of periodic exponentials

The paper presents linear integral predictors for continuous time high-f...

On the Uniqueness of Simultaneous Rational Function Reconstruction

This paper focuses on the problem of reconstructing a vector of rational...

Reconstructing Rational Functions with FireFly

We present the open-source C++ library FireFly for the reconstruction of...