Related papers: Certified Hermite Matrices from Approximate Roots

Let $I_1,\dots,I_n$ be ideals generated by linear forms in a polynomial ring over an infinite field and let $J = I_1 \cdots I_n$. We describe a minimal free resolution of $J$ and show that it is supported on a polymatroid obtained from the…

For an ideal $I\subseteq\mathbb{R}[x]$ given by a set of generators, a new semidefinite characterization of its real radical $I(V_\mathbb{R}(I))$ is presented, provided it is zero-dimensional (even if $I$ is not). Moreover we propose an…

Given an arbitrary monic polynomial $f$ over a field $F$ of characteristic 0, we use companion matrices to construct a polynomial $M_f\in F[X]$ of minimum degree such that for each root $\alpha$ of $f$ in the algebraic closure of $F$,…

Let $[f_0,\dots,f_m]$ be a tuple of series in nonnegative powers of $1/z$, $f_j(\infty)\neq0$. It is supposed that the tuple is in "general position". We give a construction of type I and type II Hermite--Pad\'e polynomials to the given…

A new symbolic algorithm to compute sums of squares multipliers (certificates) to witness the membership of non-negative univariate polynomials in a saturated univariate quadratic module is presented. Certificates are first computed in…

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

Let $k$ be an infinite field and $I\subset k [x_1, \ldots ,x_n]$ be an ideal such that dim $V(I)=q$. Denote by $(f_1, \ldots, f_s)$ a set of generators of $I$. One can see that in the set $I\cap k [x_{1},...,x_{q+1}]$ there exist non-zero…

We use the arithmetic of ideals in orders to parameterize the roots $\mu \pmod m$ of the polynomial congruence $F(\mu) \equiv 0 \pmod m$, $F(X) \in \mathbb{Z}[X]$ monic, irreducible and degree $d$. Our parameterization generalizes Gauss's…

We reobtain and often refine prior criteria due to Kaplansky, McGovern, Roitman, Shchedryk, Wiegand, and Zabavsky--Bilavska and obtain new criteria for a Hermite ring to be an \textsl{EDR}. We mention three criteria: (1) a Hermite ring $R$…

The location of real eigenvalues provides critical insights into the stability and resonance properties of physical systems. This paper presents a hybrid symbolic numeric approach for certified real eigenvalue localization. Our method…

We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the…

Given a 0-dimensional affine K-algebra R=K[x_1,...,x_n]/I, where I is an ideal in a polynomial ring K[x_1,...,x_n] over a field K, or, equivalently, given a 0-dimensional affine scheme, we construct effective algorithms for checking whether…

A new algorithm to approximate Hermitian matrices by positive semidefinite Hermitian matrices based on modified Cholesky decompositions is presented. In contrast to existing algorithms, this algorithm allows to specify bounds on the…

Farkas' lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear…

Let $A$ be an $n \times n$ positive definite Hermitian matrix with all eigenvalues between 1 and 2. We represent the permanent of $A$ as the integral of some explicit log-concave function on ${\Bbb R}^{2n}$. Consequently, there is a fully…

By a result of Helton and McCullough, open bounded convex free semialgebraic sets are exactly open (matricial) solution sets D_L of a linear matrix inequality (LMI) L(X)>0. This paper gives a precise algebraic certificate for a polynomial…

In [Jalowy, Kabluchko, Marynych, arXiv:2504.11593v1, 2025], the authors discuss a user-friendly approach to determine the limiting empirical zero distribution of a sequence of real-rooted polynomials, as the degree goes to $\infty$. In this…

Various methods can obtain certified estimates for roots of polynomials. Many applications in science and engineering additionally utilize the value of functions evaluated at roots. For example, critical values are obtained by evaluating an…

A $n\times n$ matrix $A$ has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size $(n+1)\times (n+1)$. The latter is called a minimal normal completion of $A$. A construction…

This paper is devoted to the construction of polynomial 2-surfaces which possess a polynomial area element. In particular we study these surfaces in the Euclidean space $\mathbb R^3$ (where they are equivalent to the PN surfaces) and in the…