Related papers: Bounds for the zeros of Bicomplex Polynomials usin…
In this paper, we provide a simple proof of a generalization of the Gauss-Lucas theorem. By using methods of D-companion matrix, we get the majorization relationship between the zeros of convex combinations of incomplete polynomials and an…
In this paper we improve a result recently proved by Irshad et al. [On the Inequalities Concerning to the Polar Derivative of a Polynomial with Restricted Zeroes, Thai Journal of Mathematics, 2014 (Article in Press)] and also extend…
The Sz\'asz inequality is a classical result that provides a bound for polynomials with zeros in the upper half of the complex plane, expressed in terms of their low-order coefficients. Generalizations of this result to polynomials in…
The literature on quaternionic polynomials and, in particular, on methods for determining and classifying their zero-sets, is fast developing and reveals a growing interest on this subject. In contrast, polynomials defined over the algebra…
In this paper we investigate distribution of zeros for once quasipolynom and obtain exactly lower-bound for their modulus.
In a multidimensional infinite layer bounded by two hyperplanes, the Poisson equation with the polynomial right-hand side is considered. It is shown that the Dirichlet boundary value problem and the mixed Dirichlet-Neumann boundary value…
We study the problem of placing effective upper bounds for the number of zeros of solutions of Fuchsian systems on the Riemann sphere. The principal result is an explicit (non-uniform) upper bound, polynomially growing on the frontier of…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
In this paper, we present a new method for computing bounded-degree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in…
The purpose of this paper is to present three new methods for finding all simple zeros of polynomials simultaneously. First, we give a new method for finding simultaneously all simple zeros of polynomials constructed by applying the…
For any complex polynomial P having all its zeros in the unit disk, we estimate the rate of change of the argument P (z) when the point z runs through the boundary of this disk.
We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sharp upper bound for their numbers of real solutions. This upper bound is non-trivial in that it is smaller than either the Kouchnirenko or…
In this paper, we derive an explicit formula for the bivariate Lagrange basis polynomials of a general set of checkerboard nodes. This formula generalizes existing results of bivariate Lagrange basis polynomials at the Padua nodes,…
We derive a collection of identities for bivariate Fibonacci and Lucas polynomials using essentially a matrix approach as well as properties of such polynomials when the variables $x$ and $y$ are replaced by polynomials. A wealth of…
We present some upper and lower bounds for the numerical radius of a bounded linear operator defined on complex Hilbert space, which improves on the existing upper and lower bounds. We also present an upper bound for the spectral radius of…
We investigate the zeros of polynomial solutions to the differential-difference equation \[ P_{n+1}(x)=A_{n}(x)P_{n}^{\prime}(x)+B_{n}(x)P_{n}(x), n=0,1,... \] where $A_{n}$ and $B_{n}$ are polynomials of degree at most 2 and 1…
We identify the Riemann Xi function as the Baker-Akhiezer function for a (p,1) two matrix model as p goes to infinity. We solve the two matrix model using biorthogonal polynomials and study the zeros of the polynomials in the double scaling…
We define and solve boundary value problems of Schwarz and Dirichlet type on the complex unit disk for bicomplex-valued functions.
We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…
We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…