arXiv subjects

Laureano Gonzalez-Vega

Publications and source records attributed to Laureano Gonzalez-Vega.

11 recordsLinked to original sources

arXiv2025

On the maximal spread of symmetric Bohemian matrices

Let A be a square matrix with real entries. The spread of A is defined as the maximum of the distances among the eigenvalues of A. Let $S_m[a,b]$ denote the set of all $m\times m$ symmetric matrices with entries in the real interval $[a,b]$ and let $S_m\{a,b\}$ be the subset of $S_m[a,b]$ of Bohemian matrices with population from only the extremal elements $\{a,b\}$. S. M. Fallat and J. J. Xing in 2012 proposed the following conjecture: the maximum spread in $S_m[a,b]$ is attained by a rank $2$ matrix in $S_m\{a,b\}$. X. Zhan had proved previously that the conjecture was true for $S_m[-a,a]$ with $a>0$. We will show how to interpret this problem geometrically, via polynomial resultants, in order to be able to treat this conjecture from a computational point of view. This will allow us to prove that this conjecture is true for several formerly open cases.

math.SP↗

arXiv2025

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↗

arXiv2025

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↗

arXiv2023

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↗

arXiv2019

Upper Hessenberg and Toeplitz Bohemians

We look at Bohemians, specifically those with population $\{-1, 0, {+1}\}$ and sometimes $\{0,1,i,-1,-i\}$. More, we specialize the matrices to be upper Hessenberg Bohemian. From there, focusing on only those matrices whose characteristic polynomials have maximal height allows us to explicitly identify these polynomials and give useful bounds on their height, and conjecture an accurate asymptotic formula. The lower bound for the maximal characteristic height is exponential in the order of the matrix; in contrast, the height of the matrices remains constant. We give theorems about the numbers of normal matrices and the numbers of stable matrices in these families.

cs.SC↗

arXiv2019

Computing the intersection of two quadrics through projection and lifting

This paper is devoted to presenting a new approach to determine the intersection of two quadrics based on the detailed analysis of its projection in the plane (the so called cutcurve) allowing to perform the corresponding lifting correctly. This approach is based on a new computational characterisation of the singular points of the cutcurve and on how this curve is located with respect to the projection of the considered quadrics (whose boundaries are the so called silhouette curves).

cs.CG↗

arXiv2018

Bohemian Upper Hessenberg Matrices

We look at Bohemian matrices, specifically those with entries from $\{-1, 0, {+1}\}$. More, we specialize the matrices to be upper Hessenberg, with subdiagonal entries $\pm1$. Many properties remain after these specializations, some of which surprised us. We find two recursive formulae for the characteristic polynomials of upper Hessenberg matrices. Focusing on only those matrices whose characteristic polynomials have maximal height allows us to explicitly identify these polynomials and give a lower bound on their height. This bound is exponential in the order of the matrix. We count stable matrices, normal matrices, and neutral matrices, and tabulate the results of our experiments. We prove a theorem about the only possible kinds of normal matrices amongst a specific family of Bohemian upper Hessenberg matrices.

cs.SC↗

arXiv2018

Bohemian Upper Hessenberg Toeplitz Matrices

We look at Bohemian matrices, specifically those with entries from $\{-1, 0, {+1}\}$. More, we specialize the matrices to be upper Hessenberg, with subdiagonal entries $1$. Even more, we consider Toeplitz matrices of this kind. Many properties remain after these specializations, some of which surprised us. Focusing on only those matrices whose characteristic polynomials have maximal height allows us to explicitly identify these polynomials and give a lower bound on their height. This bound is exponential in the order of the matrix.

cs.SC↗

arXiv2018

Modules projectifs de type fini, applications linéaires croisées et inverses généralisés

We give a general theory of generalised inverses and we explain the link with the theory of finitely generated projective modules. All the paper is written in constrctive mathematics in Bishop style. So all results do have a clear algorithmic content. We give also a complexity analysis of the algorihms corresponding to the main theorems. Here is a more detailed abstract in french: D'une part, nous développons la théorie générale des inverses généralisés de matrices en la mettant en rapport avec la théorie constructive des modules projectifs de type fini. D'autre part nous précisons certains aspects de cette théorie liés au calcul formel et à l'analyse numérique matricielle. Nous démontrons en particulier qu'on peut tester si un $\bf A$-module de présentation finie est projectif et calculer une matrice de projection correspondante "en temps polynomial". Plus précisément pour une matrice $A\in {\bf A}^{m \times n}$ on peut décider s'il existe un inverse généralisé $B$ pour $A$ (i.e. une matrice $B$ vérifiant $ABA=A$ et $BAB=B$) et, en cas de réponse positive, calculer un tel inverse généralisé par un algorithme qui utilise $O(p^6\,q^{2})$ opérations arithmétiques (avec $p=\inf(m,n)$, $q=\sup(m,n)$) et un nombre polynomial de tests d'appartenance d'un élément à un idéal engendré par "un petit nombre d'éléments".

math.AC↗

arXiv2018

Algebraic Linearizations of Matrix Polynomials

We show how to construct linearizations of matrix polynomials $z\mathbf{a}(z)\mathbf{d}_0 + \mathbf{c}_0$, $\mathbf{a}(z)\mathbf{b}(z)$, $\mathbf{a}(z) + \mathbf{b}(z)$ (when $\mathrm{deg}\left(\mathbf{b}(z)\right) < \mathrm{deg}\left(\mathbf{a}(z)\right)$), and $z\mathbf{a}(z)\mathbf{d}_0\mathbf{b}(z) + \mathbf{c_0}$ from linearizations of the component parts, $\mathbf{a}(z)$ and $\mathbf{b}(z)$. This allows the extension to matrix polynomials of a new companion matrix construction.

math.NA↗

arXiv2014

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↗