Searcharxiv⌕ Search

arXiv subjects

Juana Sendra

Publications and source records attributed to Juana Sendra.

13 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↗
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↗
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

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↗
arXiv2013

Rational Hausdorff Divisors: a New approach to the Approximate Parametrization of Curves

In this paper we introduce the notion of rational Hausdorff divisor, we analyze the dimension and irreducibility of its associated linear system of curves, and we prove that all irreducible real curves belonging to the linear system are rational and are at finite Hausdorff distance among them. As a consequence, we provide a projective linear subspace where all (irreducible) elements are solutions to the approximate parametrization problem for a given algebraic plane curve. Furthermore, we identify the linear system with a plane curve that is shown to be rational and we develop algorithms to parametrize it analyzing its fields of parametrization. Therefore, we present a generic answer to the approximate parametrization problem. In addition, we introduce the notion of Hausdorff curve, and we prove that every irreducible Hausdorff curve can always be parametrized with a generic rational parametrization having coefficients depending on as many parameters as the degree of the input curve.

math.AG↗
arXiv2013

The Relation Between Offset and Conchoid Constructions

The one-sided offset surface Fd of a given surface F is, roughly speaking, obtained by shifting the tangent planes of F in direction of its oriented normal vector. The conchoid surface Gd of a given surface G is roughly speaking obtained by increasing the distance of G to a fixed reference point O by d. Whereas the offset operation is well known and implemented in most CAD-software systems, the conchoid operation is less known, although already mentioned by the ancient Greeks, and recently studied by some authors. These two operations are algebraic and create new objects from given input objects. There is a surprisingly simple relation between the offset and the conchoid operation. As derived there exists a rational bijective quadratic map which transforms a given surface F and its offset surfaces Fd to a surface G and its conchoidal surface Gd, and vice versa. Geometric properties of this map are studied and illustrated at hand of some complete examples. Furthermore rational universal parameterizations for offsets and conchoid surfaces are provided.

math.AG↗
arXiv2012

Approximate Parametrization of Space Algebraic Curves

Given a non-rational real space curve and a tolerance $ε>0$, we present an algorithm to approximately parametrize the curve. The algorithm checks whether a planar projection of the space curve is $ε$-rational and, in the affirmative case, generates a planar parametrization that is lifted to an space parametrization. This output rational space curve is of the same degree as the input curve, both have the same structure at infinity, and the Hausdorff distance between them is always finite.

math.AG↗
arXiv2011

Conchoid surfaces of spheres

The conchoid of a surface $F$ with respect to given fixed point $O$ is roughly speaking the surface obtained by increasing the radius function with respect to $O$ by a constant. This paper studies {\it conchoid surfaces of spheres} and shows that these surfaces admit rational parameterizations. Explicit parameterizations of these surfaces are constructed using the relations to pencils of quadrics in $\R^3$ and $\R^4$. Moreover we point to remarkable geometric properties of these surfaces and their construction.

math.AG↗
arXiv2010

Parametrization of $ε$-rational curves: error analysis

In [Computer Aided Geometric Design 27 (2010), 212-231] the authors present an algorithm to parametrize approximately $ε$-rational curves, and they show in 2 examples that the Hausdorff distance, w.r.t. to the Euclidean distance, between the input and output curves is small. In this paper, we analyze this distance for a whole family of curves randomly generated and we automatize the strategy used in [Computer Aided Geometric Design 27 (2010), 212-231]. We find a reasonable upper bound of the Hausdorff distance between each input and output curve of the family.

math.AG↗
arXiv2009

Approximate Parametrization of Plane Algebraic Curves by Linear Systems of Curves

It is well known that an irreducible algebraic curve is rational (i.e. parametric) if and only if its genus is zero. In this paper, given a tolerance $ε>0$ and an $ε$-irreducible algebraic affine plane curve $\mathcal C$ of proper degree $d$, we introduce the notion of $ε$-rationality, and we provide an algorithm to parametrize approximately affine $ε$-rational plane curves, without exact singularities at infinity, by means of linear systems of $(d-2)$-degree curves. The algorithm outputs a rational parametrization of a rational curve $\bar{\mathcal C}$ of degree at most $d$ which has the same points at infinity as $\mathcal C$. Moreover, although we do not provide a theoretical analysis, our empirical analysis shows that $\bar{\mathcal C}$ and $\mathcal C$ are close in practice.

math.AG↗
arXiv2007

An Algebraic Analysis of Conchoids to Algebraic Curves

We study conchoids to algebraic curve from the perspective of algebraic geometry, analyzing their main algebraic properties. We introduce the formal definition of conchoid of an algebraic curve by means of incidence diagrams. We prove that, with the exception of a circle centered at the focus and taking $d$ as its radius, the conchoid is an algebraic curve having at most two irreducible components. In addition, we introduce the notions of special and simple components of a conchoid. Moreover we state that, with the exception of lines passing through the focus, the conchoid always has at least one simple component and that, for almost every distance, all the components of the conchoid are simple. We state that, in the reducible case, simple conchoid components are birationally equivalent to the initial curve, and we show how special components can be used to decide whether a given algebraic curve is the conchoid of another curve.

math.AG↗