Searcharxiv⌕ Search

arXiv subjects

J. Rafael Sendra

Publications and source records attributed to J. Rafael Sendra.

At least 19 recordsLinked to original sources
arXiv2026

Conditions for eigenvalue configurations of two real symmetric matrices (symmetric polynomial approach)

Given two real symmetric matrices, their eigenvalue configuration is the relative arrangement of their eigenvalues on the real line. In this paper, we consider the following problem: given two parametric real symmetric matrices and an eigenvalue configuration, find a simple condition on the parameters such that their eigenvalues have the given configuration. We give an algorithm which expresses the eigenvalue configuration problem as a real root counting problem of certain symmetric polynomials, whose roots can be counted using the Fundamental Theorem of Symmetric Polynomials and Descartes' rule of signs.

math.AG↗
arXiv2025

Conditions for eigenvalue configurations of two real symmetric matrices (signature approach)

For two real symmetric matrices, their eigenvalue configuration is therelative arrangement of their eigenvalues on the real line. We consider the following problem: given two parametric real symmetric matrices and an eigenvalue configuration, find a simple condition on the parameters such that the two matrices have the given eigenvalue configuration. In this paper, we develop theory and give an algorithm for this problem. The output of the algorithm is a condition written in terms of the signatures of certain related symmetric matrices.

math.AG↗
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

Characterization of polynomial surfaces of revolution and polynomial quadrics

In this paper, we characterize the polynomiality of surfaces of revolution by means of the polynomiality of an associated plane curve. In addition, if the surface of revolution is polynomial, we provide formulas for computing a polynomial parametrization, over $\mathbb{C}$, of the surface. Furthermore, we perform the first steps towards the analysis of the existence, and actual computation, of real polynomial parametrizations of surfaces of revolution. As a consequence, we give a complete picture of the real polynomiality of quadrics and we formulate a conjecture for the general case.

math.AG↗
arXiv2024

Algorithm for globally identifiable reparametrizations of ODEs

Structural global parameter identifiability indicates whether one can determine a parameter's value in an ODE model from given inputs and outputs. If a given model has parameters for which there is exactly one value, such parameters are called globally identifiable. Given an ODE model involving not globally identifiable parameters, first we transform the system into one with locally identifiable parameters. As a main contribution of this paper, then we present a procedure for replacing, if possible, the ODE model with an equivalent one that has globally identifiable parameters. We first derive this as an algorithm for one-dimensional ODE models and then reuse this approach for higher-dimensional models.

eess.SY↗
arXiv2022

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

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

On the base point locus of surface parametrizations: formulas and consequences

This paper shows that the multiplicity of the base points locus of a projective rational surface parametrization can be expressed as the degree of the content of a univariate resultant. As a consequence, we get a new proof of the degree formula relating the degree of the surface, the degree of the parametrization, the base points multiplicity, and the degree of the rational map induced by the parametrization. In addition, we extend both formulas to the case of dominant rational maps of the projective plane and describe how the base point loci of a parametrization and its reparametrizations are related. As an application of these results, we explore how the degree of a surface reparametrization is affected by the presence of base points.

math.AG↗
arXiv2020

Existence and convergence of Puiseux series solutions for autonomous first order differential equations

Given an autonomous first order algebraic ordinary differential equation F(y,y')=0, we prove that every formal Puiseux series solution, expanded around any finite point or at infinity, is convergent. The proof is constructive and we provide an algorithm to describe all such Puiseux series solutions. Moreover, we show that for any point in the complex plane there exists a solution of the differential equation which defines an analytic curve passing through this point.

math.AG↗
arXiv2020

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

Algebraic, rational and Puiseux series solutions of systems of autonomous algebraic ODEs of dimension one

In this paper, we study the algebraic, rational and formal Puiseux series solutions of certain type of systems of autonomous ordinary differential equations. More precisely, we deal with systems which associated algebraic set is of dimension one. We establish a relationship between the solutions of the system and the solutions of an associated first order autonomous ordinary differential equation, that we call the reduced differential equation. Using results on such equations, we prove the convergence of the formal Puiseux series solutions of the system, expanded around a finite point or at infinity, and we present an algorithm to describe them. In addition, we bound the degree of the possible algebraic and rational solutions, and we provide an algorithm to decide their existence and to compute such solutions if they exist. Moreover, if the reduced differential equation is non trivial, for every given point $(x_0,y_0)$ in the complex plane, we prove the existence of a convergent Puiseux series solution $y(x)$ of the original system such that $y(x_0)=y_0$.

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

Solving First Order Autonomous Algebraic Ordinary Differential Equations by Places

Given a first-order autonomous algebraic ordinary differential equation, we present a method for computing formal power series solutions by means of places. We provide an algorithm for computing a full characterization of possible initial values, classified in terms of the number of distinct formal power series solutions extending them. In addition, if a particular initial value is given, we present a second algorithm that computes all the formal power series solutions, up to a suitable degree, corresponding to it. Furthermore, when the ground field is the field of the complex numbers, we prove that the computed formal power series solutions are all convergent in suitable neighborhoods.

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↗