Related papers: Logarithms and Square Roots of Real Matrices
In this paper, we prove that if $f(x)=\sum_{k=0}^n{n\choose k}a_kx^k$ is a polynomial with real zeros only, then the sequence $\{a_k\}_{k=0}^n$ satisfies the following inequalities $a_{k+1}^2(1-\sqrt{1-c_k})^2/a_k^2…
We prove that if a polynomial has a root mod $p$ for every large prime $p$, then it has a real root. As an application, we show that the primes can't be covered by finitely many positive definite binary quadratic forms.
Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…
The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and…
We present a new algorithm for solving the real roots of a bivariate polynomial system $\Sigma=\{f(x,y),g(x,y)\}$ with a finite number of solutions by using a zero-matching method. The method is based on a lower bound for bivariate…
We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…
A real square matrix is algebraically positive if there exists a real polynomial $f$ such that $f(A)$ is a positive matrix. In this paper, we give a sufficient condition for a sign pattern matrix to allow algebraic positivity, and give some…
We present six Theorems on the univariate real Polynomial, using which we develop a new algorithm for deciding the existence of atleast one real root for univariate integer Polynomials. Our algorithm outputs that no positive real root…
We present algorithmic, complexity and implementation results for the problem of isolating the real roots of a univariate polynomial in $B_{\alpha} \in L[y]$, where $L=\QQ(\alpha)$ is a simple algebraic extension of the rational numbers. We…
On the math-fun mailing list (7 May 2013), Neil Sloane asked to calculate the number of $n \times n$ matrices with entries in $\{0,1\}$ which are squares of other such matrices. In this paper we analyze the case that the arithmetic is in…
A bimatroid is a matroid-like generalization of the collection of regular minors of a matrix. In this article, we use the theory of Lorentzian polynomials to study the logarithmic concavity of natural sequences associated to bimatroids.…
This article provides a simple trigonometric method for determining how many roots of a quartic equation are real and how many are complex, without solving the equation. The approach replaces the quartic's classical discriminant -- a…
We present algorithmic and complexity results concerning computations with one and two real algebraic numbers, as well as real solving of univariate polynomials and bivariate polynomial systems with integer coefficients using Sturm-Habicht…
A number $\lambda \in \mathbb C $ is called an {\it eigenvalue} of the matrix polynomial $P(z)$ if there exists a nonzero vector $x \in \mathbb C^n$ such that $P(\lambda)x = 0$. Note that each finite eigenvalue of $P(z)$ is a zero of the…
Computing the roots of a univariate polynomial is a fundamental and long-studied problem of computational algebra with applications in mathematics, engineering, computer science, and the natural sciences. For isolating as well as for…
Many problems in computer algebra and numerical analysis can be reduced to counting or approximating the real roots of a polynomial within an interval. Existing verified root-counting procedures in major proof assistants are mainly based on…
We prove that the expectation of the logarithm of the condition number of each of the zeros of the characteristic polynomial of a complex standard Gaussian matrix is ${\Omega}(n)$. This may provide an explanation for the common wisdom in…
In this paper, we exhibit new monotonicity properties of roots of families of orthogonal polynomials $P_n^{(z)}(x)$ depending polynomially on a parameter (Laguerre and Gegenbauer). By establishing that $P_n^{(z)}(x)$ are realrooted in $z$…
Using a variety of matrix techniques, the problem of locating the left eigenvalues of the quaternion companion matrices are investigated in this paper. In a recent paper, Dar et al. [6], proved that the zeros of a quaternionic polynomial…
We discuss the eigenvalue problem for 3x3 octonionic Hermitian matrices which is relevant to the Jordan formulation of quantum mechanics. In contrast to the eigenvalue problems considered in our previous work, all eigenvalues are real and…