Related papers: Bounds for the Zeros of Quaternionic Polynomials v…
We obtain new effective results in best approximation theory, specifically moduli of uniqueness and constants of strong unicity, for the problem of best uniform approximation with bounded coefficients, as first considered by Roulier and…
Several recent papers construct auxiliary polynomials to bound the Weil height of certain classes of algebraic numbers from below. Following these techniques, the author gave a general method for introducing auxiliary polynomials to…
Solutions to many important partial differential equations satisfy bounds constraints, but approximations computed by finite element or finite difference methods typically fail to respect the same conditions. Chang and Nakshatrala enforce…
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…
The presented analysis determines several new bounds on the roots of the equation $a_n x^n + a_{n-1} x^{n-1} + \cdots + a_0 = 0$ (with $a_n > 0$). All proposed new bounds are lower than the Cauchy bound max$\{1, \sum_{j=0}^{n-1} |a_j/a_n|…
We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like…
Sparse polynomial systems with vertical coefficient dependencies arise naturally when describing the critical points of optimization problems and, when augmented with linear forms, the steady states of chemical reaction networks. Moreover,…
We study equidistribution problem of zeros in relation to a sequence of $Z$-asymptotically Chebyshev polynomials on $\mathbb{C}^{m}$. We use certain results obtained in a very recent work of Bayraktar, Bloom and Levenberg and have an…
We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…
We study algorithms for approximating the permanent of a random matrix when the entries are slightly biased away from zero. This question is motivated by the goal of understanding the classical complexity of linear optics and \emph{boson…
We consider the set S(n,0) of monic complex polynomials of degree $n\ge 2$ having all their zeros in the closed unit disk and vanishing at 0. For $p\in S(n,0)$ we let $|p|_{0}$ denote the distance from the origin to the zero set of $p'$. We…
Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
In this paper, we introduce a new family of codes relevent for rank and sum-rank metrics. These codes are based on an effective Chinese remainders theorem for linearized polynomials over finite fields. We propose a decoding algorithm for…
By applying the Euler--Rayleigh methods to a specific representation of the Jacobi polynomials as hypergeometric functions, we obtain new bounds for their largest zeros. In particular, we derive upper and lower bound for…
We draw a new connection between Coppersmith's method for finding small solutions to polynomial congruences modulo integers and the capacity theory of adelic subsets of algebraic curves. Coppersmith's method uses lattice basis reduction to…
The purpose of this note is to extend in a simple and unified way the known results on interlacing of zeros of paraorthogonal polynomials on the unit circle. These polynomials can be regarded as the characteristic polynomials of any matrix…
The decomposition of the polynomials on the quaternionic unit sphere in $\Hd$ into irreducible modules under the action of the quaternionic unitary (symplectic) group and quaternionic scalar multiplication has been studied by several…
We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.
In this work, we are dealing with some properties relating the zeros of a polynomial and its Mahler measure. We provide estimates on the number of real zeros of a polynomial, lower bounds on the distance between the zeros of a polynomial…