论文信息 - Decomposing tropical rational functions

Decomposing tropical rational functions

Abstract An algorithm is designed to decompose 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).

Dima Grigoriev

[1] Dima Grigoriev,et al. Tropical Combinatorial Nullstellensatz and Fewnomials Testing , 2017, FCT.

[2] Joachim von zur Gathen,et al. Multivariate Polynomial Decomposition , 2003, Applicable Algebra in Engineering, Communication and Computing.

[3] Semiconjugate Rational Functions: A Dynamical Approach , 2017, 1707.02948.

[4] Liwen Zhang,et al. Tropical Geometry of Deep Neural Networks , 2018, ICML.

[5] J. Ritt,et al. Prime and composite polynomials , 1922 .

[6] Joachim von zur Gathen,et al. Functional Decomposition of Polynomials: The Wild Case , 1990, J. Symb. Comput..

[7] Razvan Pascanu,et al. On the Number of Linear Regions of Deep Neural Networks , 2014, NIPS.

[8] J. Ritt,et al. Permutable rational functions , 1923 .

[9] Lenore Blum,et al. Complexity and Real Computation , 1997, Springer New York.

[10] Dima Grigoriev. Tropical Newton-Puiseux Polynomials , 2018, CASC.

[11] Richard Zippel,et al. Decomposition of Algebraic Functions , 1994, J. Symb. Comput..