Computing branches and asymptotes of meromorphic functions

From MaRDI portal
Publication:6100700



Abstract: In this paper, we first summarize the existing algorithms for computing all the generalized asymptotes of a plane algebraic curve implicitly or parametrically defined. From these previous results, we derive a method that allows to easily compute the whole branch and all the generalized asymptotes of a special curve defined in n-dimensional space by a parametrization that is not necessarily rational. So, some new concepts and methods are established for this type of curves. The approach is based on the notion of perfect curves introduced from the concepts and results presented in previous papers.


The lowest degree curve \(\tilde{\mathcal{C}}\) approximating a given one \(\mathcal{C}\) near a given point at infinity is known as a generalized asymptote of \(\mathcal{C}\). The paper begins by recalling the formal definition of a generalized asymptote by means of Puisieux series near the points at infinity of a curve. Later the authors review previously existing algorithms to compute generalized asymptotes of plane algebraic curves, either implicitly or explicitly defined. As its main result, the paper introduces, by means of the concept of perfect curves (a curve that is its own generalized asymptote), a way to extend those tecniques to parametrically defined curves in any-dimensional spaces through limit computations. It must be also noted that the parametrization is not assumed to be rational.











This page was built for publication: Computing branches and asymptotes of meromorphic functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6100700)