Related papers: On computing root polynomials and minimal bases of…

Approximate computing has shown to provide new ways to improve performance and power consumption of error-resilient applications. While many of these applications can be found in image processing, data classification or machine learning, we…

A polynomial $p\in\mathbb{R}[x]$ is a divisor of some polynomial $0\neq f\in\mathbb{R}[x]$ with non-negative coefficients if and only if $p$ does not have a positive real root. The lowest possible degree of such $f$ for a given $p$ is known…

Recent results for rotations expressed as polynomials of spin matrices are derived here by elementary differential equation methods. Structural features of the results are then examined in the framework of biorthogonal systems, to obtain an…

Predicting unobserved entries of a partially observed matrix has found wide applicability in several areas, such as recommender systems, computational biology, and computer vision. Many scalable methods with rigorous theoretical guarantees…

This work is to propose an iterative method of choice to compute a stable subspace of a regular matrix pencil. This approach is to define a sequence of matrix pencils via particular left null spaces. We show that this iteration preserves a…

The notion of a "root base" together with its geometry plays a crucial role in the theory of finite and affine Lie theory. However, it is known that such a notion does not exist for the recent generalizations of finite and affine root…

We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…

We revisit the concept of a minimal basis through the lens of the theory of modules over a commutative ring $R$. We first review the conditions for the existence of a basis for submodules of $R^n$ where $R$ is a B\'{e}zout domain. Then, we…

Let $f(x)=p(x)-q(x)$ be a polynomial with real coefficients whose roots have nonnegative real part, where $p$ and $q$ are polynomials with nonnegative coefficients. In this paper, we prove the following: Given an initial point $x_0 > 0$,…

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…

We provide an analogue of Wedderburn's factorization method for central polynomials with coefficients in an octonion division algebra, and present an algorithm for fully factoring polynomials of degree $n$ with $n$ conjugacy classes of…

The main perpose of this paper is to sudy the roots of a familly of polynomials that arise from a linear recurrences associated to Pascal's triangle and their zero attractor, using an analytical methods based on conformal mappings.

The question about the behavior of gaps between zeros of polynomials under differentiation is classical and goes back to Marcel Riesz. In this paper, we analyze a nonlocal nonlinear partial differential equation formally derived by Stefan…

In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which…

We present a new method to calculate analytically the roots of the general complex polynomial of degree three. Thismethod is based on the approach of appropriated changes of variable involving an arbitrary parameter. The advantageof this…

We consider the coincident root loci consisting of the polynomials with at least two double roots andpresent a linear basis of the corresponding ideal in the algebra of symmetric polynomials in terms of the Jack polynomials with special…

In this paper, we develop a new technique which we call representation theory of the real hyperrectangle, which describes how to compute the eigenvectors and eigenvalues of certain matrices arising from hyperrectangles. We show that these…

This paper revisits an algorithm for isolating real roots of univariate polynomials based on continued fractions. It follows the work of Vincent, Uspen- sky, Collins and Akritas, Johnson and Krandick. We use some tricks, especially a new…

There have been some effective tools for solving (constant/parametric) semi-algebraic systems in Maple's library RegularChains since Maple 13. By using the functions of the library, e.g., RealRootClassfication, one can prove and discover…

In this paper we present a complete method for finding the roots of all polynomials of the form $\phi(z)=c_n z^n+c_{n-1} z^{n-1}+\dots+c_1 z+c_0$ over a given octonion division algebra. When $\phi(z)$ is monic we also consider the companion…