2019/01/04 by Dima Grigoriev, Grigoriev, Dima
Computer Science · #14T05 #Algebraic Geometry (math.AG) #Coding theory and cryptography #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Methods in Verification #Polynomial and algebraic computation
paper · pdf · doi:10.48550/arxiv.1901.01180
openalex publication_date 2019/01/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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).