An algorithm for computing an integral basis in an algebraic function field
Journal of Symbolic Computation
The MAGMA algebra system I: the user language
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Rational parametrization of surfaces
Journal of Symbolic Computation
An algorithm for computing the integral closure
Journal of Symbolic Computation
Two computational techniques for singularity resolution
Journal of Symbolic Computation - Special issue on computer algebra and mechanized reasoning: selected St. Andrews' ISSAC/Calculemus 2000 contributions
Journal of Symbolic Computation
Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes
Mathematics of Computation
Multi-variate polynomials and Newton-Puiseux expansions
SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
Effective construction of algebraic geometry codes
IEEE Transactions on Information Theory - Part 1
Hi-index | 0.00 |
In this paper we propose the concept of formal desingularizations as a substitute for the resolution of algebraic varieties. Though a usual resolution of algebraic varieties provides more information on the structure of singularities there is evidence that the weaker concept is enough for many computational purposes. We give a detailed study of the Jung method and show how it facilitates an efficient computation of formal desingularizations for projective surfaces over a field of characteristic zero, not necessarily algebraically closed. The paper includes a constructive extension of the Theorem of Jung-Abhyankar, a generalization of Duval's Theorem on rational Puiseux parametrizations to the multivariate case and a detailed description of a system for multivariate algebraic power series computations.