SearcharxivSearch

arXiv subjects

Jorge Caravantes

Publications and source records attributed to Jorge Caravantes.

18 recordsLinked to original sources

Relative position of a parabola or a hyperbola and an ellipse without computing intersection points

Efficient methods to determine the relative position of two conics are of great interest for applications in robotics, computer animation, CAGD, computational physics, and other areas. We present a method to obtain the relative position of a parabola or a hyperbola, and a coplanar ellipse, directly from the coefficients of their implicit equations, even if they are not given in canonical form, and avoiding the computation of the corresponding intersection points (and their characteristics).

cs.CG

Tools for analyzing the intersection curve between a torus and a quadric through projection and lifting

This article introduces efficient and user-friendly tools for analyzing the intersection curve between a ringed torus and an irreducible quadric surface. Without loose of generality, it is assumed that the torus is centered at the origin, and its axis of revolution coincides with the $z$-axis. The paper primarily focuses on examining the curve's projection onto the plane $z=0$, referred to as the cutcurve, which is essential for ensuring accurate lifting procedures. Additionally, we provide a detailed characterization of the singularities in both the projection and the intersection curve, as well as the existence of double tangents. A key tool for the analysis is the theory of resultant and subresultant polynomials.

math.AG

Closed formulae for multiple roots of univariate polynomials through subresultants

The computation of the topology of a real algebraic plane curve is greatly simplified if there are no more than one critical point in each vertical line: the general position condition. When this condition is not satisfied, then a finite number of changes of coordinates will move the initial curve to one in general position. We will show many cases where the topology of the considered curve around a critical point is very easy to compute even if the curve is not in general position. This will be achieved by introducing a new family of formulae describing, in many cases and through subresultants, the multiple roots of a univariate polynomial as rational functions of the considered polynomial involving at most one square root. This new approach will be used to show that the topology of cubics, quartics and quintics can be computed easily even if the curve is not in general position and to characterise those higher degree curves where this approach can be used. We will apply also this technique to determine the intersection curve of two quadrics and to study how to characterise the type of the curve arising when intersecting two ellipsoids.

math.AG

Birational Reparametrizations of Surfaces

Given a unirational parameterization of a surface, we present a general algorithm to determine a birational parameterization without using parameterization algorithms. Additionally, if the surface is assumed to have a birational parametrization with empty base locus, and the input parametrization is transversal, the degree of the solution is determined in advance and the dimension of the space of solutions is reduced. As a consequence, for these cases, we present a second faster algorithm.

math.AG

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

Computing the topology of a planar or space hyperelliptic curve

We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose topology is easy to compute, under a birational mapping of the plane or the space. We report on a {\tt Maple} implementation of these algorithms, and present several examples. Complexity and certification issues are also discussed.

math.GT

On the computation of the straight lines contained in a rational surface

In this paper we present an algorithm to compute the (real and complex) straight lines contained in a rational surface, defined by a rational parameterization. The algorithm relies on the well-known theorem of Differential Geometry that characterizes real straight lines contained in a surface as curves that are simultaneously asymptotic lines, and geodesics. We also report on an implementation carried out in Maple 18, and we compare the behavior of our algorithm with two brute-force approaches.

math.AG

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

On the square-freeness of the offset equation to a rational planar curve

It is well known that an implicit equation of the offset to a rational planar curve can be computed by removing the extraneous components of the resultant of two certain polynomials computed from the parametrization of the curve. Furthermore, it is also well known that the implicit equation provided by the non-extraneous component of this resultant has at most two irreducible factors. In this paper, we complete the algebraic description of this resultant by showing that the multiplicity of the factors corresponding to the offset can be computed in advance. In particular, when the parametrization is proper, i.e. when the curve is just traced once by the parametrization, we prove that any factor corresponding to a simple component of the offset has multiplicity 1, while the factor corresponding to the special component, if any, has multiplicity 2. Hence, if the parametrization is proper and there is no special component, the non-extraneous part of the resultant is square-free. In fact, this condition is proven to be also sufficient. Additionally, this result provides a simple test to check whether or not a given rational curve is the offset of another curve.

math.AG

A new method to compute the singularities of offsets to rational plane curves

Given a planar curve defined by means of a real rational parametrization, we prove that the affine values of the parameter generating the real singularities of the offset are real roots of a univariate polynomial that can be derived from the parametrization of the original curve, without computing or making use of the implicit equation of the offset. By using this result, a finite set containing all the real singularities of the offset, and in particular all the real self-intersections of the offset, can be computed. We also report on experiments carried out in the computer algebra system Maple, showing the efficiency of the algorithm for moderate degrees.

math.AG

A canonical form for the continuous piecewise polynomial functions

We present in this paper a canonical form for the elements in the ring of continuous piecewise polynomial functions. This new representation is based on the use of a particular class of functions $$\{C_i(P):P\in\Q[x],i=0,\ldots,°(P)\}$$ defined by $$C_i(P)(x)= \left\{ \begin{array}{cll}0 & \mbox{ if } & x \leq α\\ P(x) & \mbox{ if } & x \geq α\end{array} \right.$$ where $α$ is the $i$-th real root of the polynomial $P$. These functions will allow us to represent and manipulate easily every continuous piecewise polynomial function through the use of the corresponding canonical form. It will be also shown how to produce a "rational" representation of each function $C_{i}(P)$ allowing its evaluation by performing only operations in $\Q$ and avoiding the use of any real algebraic number.

cs.SC

Formal properties in small codimension

In this note we extend connectedness results to formal properties of inverse images under proper maps of Schubert varieties and of the diagonal in products of projective rational homogeneous spaces

math.AG

Fano threefolds with noncyclic torsion in the divisor class group

In this note we study Fano threefolds with noncyclic torsion in the divisor class group. Since they can all be obtained as quotients of Fano threefolds, we get also all examples that can be obtained as quotients of low codimension Fanos in the weighted projective space.

math.AG

Low codimension Fano--Enriques threefolds

In this paper we study Fano threefolds with a torsion divisor (Fano--Enriques). Due to this torsion divisor, they can be described as quotients of Fano threefolds by a finite abelian group action. We start from lists of Fano threefolds by Reid, Fletcher and Altınok and check which of them admit such an action with a Fano--Enriques quotient.

math.AG

On the Picard group of low-codimension subvarieties

We introduce a method to determine if n-dimensional smooth subvarieties of an ambient space of dimension at most 2n − 2 inherit the Picard group from the ambient space (as it happens when the ambient space is a projective space, according to results of Barth and Larsen). As an application, we give an affirmative answer (up to some mild natural numerical conditions) when the ambient space is a Grassmannian of lines (thus improving results of Barth, Van de Ven and Sommese) or a product of two projective spaces of the same dimension.

math.AG