On decomposition of tame polynomials and rational functions

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
9 pages

Keywords

Symbolic Computation, Commutative Algebra, I.1.1; I.1.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/160911

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0804.1649
 http://arxiv.org/abs/0804.1649
 Computer algebra in scientific computing, 219--226, Lecture Notes in Comput. Sci., 4194, Springer, Berlin, 2006. MR2279795 (2008d:12001)

Collections

arXiv