SearcharxivSearch

arXiv subjects

David Sevilla

Publications and source records attributed to David Sevilla.

At least 19 recordsLinked to original sources

Covering rational surfaces with rational parametrization images

Let $S$ be a rational projective surface given by means of a projective rational parametrization whose base locus satisfies a mild assumption. In this paper we present an algorithm that provides three rational maps $f,g,h:\mathbb{A}^2 --\to S\subset \mathbb{P}^n$ such that the union of the three images covers $S$. As a consequence, we present a second algorithm that generates two rational maps $f,\tilde{g}:\mathbb{A}^2 --\to S$, such that the union of their images covers the affine surface $S\cap \mathbb{A}^n$. In the affine case, the number of rational maps involved in the cover is in general optimal.

math.AG

Transforming ODEs and PDEs with radical coefficients into rational coefficients

We present an algorithm that transforms, if possible, a given ODE or PDE with radical function coefficients into one with rational coefficients by means of a rational change of variables. It also applies to systems of linear ODEs. It is based on previous work on reparametrization of radical algebraic varieties.

math.CA

On the existence of birational surjective parametrizations of affine surfaces

In this paper we show that not all affine rational complex surfaces can be parametrized birationally and surjectively. For this purpose, we prove that, if S is an affine complex surface whose projective closure is smooth, a necessary condition for S to admit a birational surjective parametrization from an open subset of the affine complex plane is that the infinity curve of S must contain at least one rational component. As a consequence of this result we provide examples of affine rational surfaces that do not admit birational surjective parametrizations.

math.AG

Algebraic and algorithmic aspects of radical parametrizations

In this article algebraic constructions are introduced in order to study the variety defined by a radical parametrization (a tuple of functions involving complex numbers, $n$ variables, the four field operations and radical extractions). We provide algorithms to implicitize radical parametrizations and to check whether a radical parametrization can be reparametrized into a rational parametrization.

math.AG

Missing sets in rational parametrizations of surfaces of revolution

Parametric representations do not cover, in general, the whole geometric object that they parametrize. This can be a problem in practical applications. In this paper we analyze the question for surfaces of revolution generated by real rational profile curves, and we describe a simple small superset of the real zone of the surface not covered by the parametrization. This superset consists, in the worst case, of the union of a circle and the mirror curve of the profile curve.

math.AG

Covering Rational Ruled Surfaces

We present an algorithm that covers any given rational ruled surface with two rational parametrizations. In addition, we present an algorithm that transforms any rational surface parametrization into a new rational surface parametrization without affine base points and such that the degree of the corresponding maps is preserved.

math.AG

First Steps Towards Radical Parametrization of Algebraic Surfaces

We introduce the notion of radical parametrization of a surface, and we provide algorithms to compute such type of parametrizations for families of surfaces, like: Fermat surfaces, surfaces with a high multiplicity (at least the degree minus 4) singularity, all irreducible surfaces of degree at most 5, all irreducible singular surfaces of degree 6, and surfaces containing a pencil of low-genus curves. In addition, we prove that radical parametrizations are preserved under certain type of geometric constructions that include offset and conchoids.

cs.SC

Tschirnhaus-Weierstrass curves

We define the concept of Tschirnhaus-Weierstrass curve, named after the Weierstrass form of an elliptic curve and Tschirnhaus transformations. Every pointed curve has a Tschirnhaus-Weierstrass form, and this representation is unique up to a scaling of variables. This is useful for computing isomorphisms between curves.

math.AG

Effective radical parametrization of trigonal curves

Let $C$ be a non-hyperelliptic algebraic curve. It is known that its canonical image is the intersection of the quadrics that contain it, except when $C$ is trigonal (that is, it has a linear system of degree 3 and dimension 1) or isomorphic to a plane quintic (genus 6). In this context, we present a method to decide whether a given algebraic curve is trigonal, and in the affirmative case to compute a map from $C$ to the projective line whose fibers cut out the linear system.

math.AG

Deciding trigonality of algebraic curves

Let C be a non-hyperelliptic algebraic curve of genus at least 3. Enriques and Babbage proved that its canonical image is the intersection of the quadrics that contain it, except when C is trigonal (that is, it has a linear system of degree 3 and dimension 1) or C is isomorphic to a plane quintic (genus 6). We present a method to decide whether a given algebraic curve is trigonal, and in the affirmative case to compute a map from C to the projective line whose fibers cut out the linear system. It is based on the Lie algebra method presented in Schicho (2006). Our algorithm is part of a larger effort to determine whether a given algebraic curve admits a radical parametrization.

math.AG

Radical Parametrization of Algebraic Curves by Adjoint Curves

We present algorithms for parametrizing by radicals an irreducible curve, not necessarily plane, when the genus is less o equal to 4 and they are defined over an algebraically closed field of characteristic zero. In addition, we also present an algorithm for parametrizing by radicals any irreducible plane curve of degree $d$ having at least a point of multiplicity $d-r$, with $1\leq r \leq 4$ and, as a consequence, every irreducible plane curve of degree $d \leq 5$ and every irreducible singular plane curve of degree 6.

math.AG

Polynomial integration on regions defined by a triangle and a conic

We present an efficient solution to the following problem, of relevance in a numerical optimization scheme: calculation of integrals of the type \[\iint_{T \cap \{f\ge0\}} ϕ_1ϕ_2 \, dx\,dy\] for quadratic polynomials $f,ϕ_1,ϕ_2$ on a plane triangle $T$. The naive approach would involve consideration of the many possible shapes of $T\cap\{f\geq0\}$ (possibly after a convenient transformation) and parameterizing its border, in order to integrate the variables separately. Our solution involves partitioning the triangle into smaller triangles on which integration is much simpler.

cs.SC

Aplicacion de la descomposicion racional univariada a monstrous moonshine (in Spanish)

This paper shows how to use Computational Algebra techniques, namely the decomposition of rational functions in one variable, to explore a certain set of modular functions, called replicable functions, that arise in Monstrous Moonshine. In particular, we have computed all the rational relations with coefficients in Z between pairs of replicable functions. ----- En este articulo mostramos como usar tecnicas de Algebra Computacional, concretamente la descomposcion de funciones racionales univariadas, para estudiar un cierto conjunto de funciones modulares, llamadas funciones replicables, que aparecen en Monstrous Moonshine. En concreto, hemos calculado todas las relaciones racionales con coeficientes en Z entre pares de funciones replicables.

math.NT

Computing the fixing group of a rational function

Let G=Aut_K (K(x)) be the Galois group of the transcendental degree one pure field extension K(x)/K. In this paper we describe polynomial time algorithms for computing the field Fix(H) fixed by a subgroup H < G and for computing the fixing group G_f of a rational function f in K(x).

cs.SC

Unirational fields of transcendence degree one and functional decomposition

In this paper we present an algorithm to compute all unirational fields of transcendence degree one containing a given finite set of multivariate rational functions. In particular, we provide an algorithm to decompose a multivariate rational function f of the form f=g(h), where g is a univariate rational function and h a multivariate one.

cs.SC

On decomposition of tame polynomials and rational functions

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.

cs.SC