On decomposition of tame polynomials and rational functions

Authors:
Jaime Gutierrez;David Sevilla
Affiliations:
Faculty of Sciences, University of Cantabria, Santander, Spain;Dpt. of Computer Science and Software Engineering, Concordia University, Montréal, QC, Canada
Venue:
CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing
Year:
2006

Citing 9
Cited 0

Polynomial decomposition algorithms

Journal of Symbolic Computation
Functional decomposition ofpolynomials: the tame case

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Functional decomposition of polynomials: The wild case

Journal of Symbolic Computation
Rational function decomposition

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
A rational function decomposition algorithm by near-separated polynomials

Journal of Symbolic Computation
Ideal decompositions and subfields

Journal of Symbolic Computation
On multivariate rational function decomposition

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Polynomial Decomposition Algorithm of Almost Quadratic Complexity

AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On Ritt's decomposition theorem in the case of finite fields

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

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.