Abstract
In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial, proving it for arbitrary tame polynomials, and considering the case of rational functions. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Gutierrez, J., & Sevilla, D. (2006). On decomposition of tame polynomials and rational functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4194 LNCS, pp. 219–226). Springer Verlag. https://doi.org/10.1007/11870814_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
