On decomposition of tame polynomials and rational functions

Simple item page
dc.creatorGutierrez, Jaime
dc.creatorSevilla, David
dc.date2008-04-10
dc.date.accessioned2026-07-07T09:38:43Z
dc.date.available2026-07-07T09:38:43Z
dc.descriptionIn 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.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/0804.1649
dc.identifierhttp://arxiv.org/abs/0804.1649
dc.identifierComputer algebra in scientific computing, 219--226, Lecture Notes in Comput. Sci., 4194, Springer, Berlin, 2006. MR2279795 (2008d:12001)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/160911
dc.subjectSymbolic Computation
dc.subjectCommutative Algebra
dc.subjectI.1.1; I.1.2
dc.titleOn decomposition of tame polynomials and rational functions
dc.typetext

Files

Collections

arXiv