On Decomposition of Tame Polynomials and Rational Functions

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.

• Type: Conference
• Year: 2006
• Where: CASC
• Authors: Jaime Gutierrez, David Sevilla
• Keywords: Algorithmic Considerations, Arbitrary Tame Polynomials, CASC 2006, Certain Groups, Mathematics