Related papers: Cauchy-like and Pellet-like results for polynomial…

We prove an equidistribution result for the zeros of polynomials with integer coefficients and simple zeros. Specifically, we show that the normalized zero measures associated with a sequence of such polynomials, having small height…

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…

We introduce a class of Schur type functions associated with polynomial sequences of binomial type. This can be regarded as a generalization of the ordinary Schur functions and the factorial Schur functions. This generalization satisfies…

A method for finding relations for the roots of polynomials is presented. Our approach allows us to get a number of relations for the zeros of the classical polynomials and for the roots of special polynomials associated with rational…

We prove characterizations of Appell polynomials by means of symmetric property. For these polynomials, we establish a simple linear expression in terms of Bernoulli and Euler polynomials. As applications, we give interesting examples. In…

We estabish an analog of the Cauchy-Poincare separation theorem for normal matrices in terms of majorization. Moreover, we present a solution to the inverse spectral problem (Borg-type result) for a normal matrix. Using this result we…

Parabolic integro-differential model Cauchy problem is considered in the scale of Lp -spaces of functions whose regularity is defined by a scalable Levy measure. Existence and uniqueness of a solution is proved by deriving apriori…

A new approach for integration of the initial value problem for ordinary differential equations is suggested. The algorithm is based on approximation of the solution by a system of functions that contains orthogonal exponential polynomials.

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

We prove the uniqueness for an inverse problem of determining a matrix coefficient $P(x)$ of a system of evolution equations $\sigma \ppp_t u = \ppp_x^2 u(t,x) - P(x) u(t,x)$ for $0<x<\ell$ and $0<t<T$, where $\ell>0$ and $T>0$ are…

We establish general weak majorization inequalities, relating the leading exponents of the eigenvalues of matrices or matrix polynomials over the field of Puiseux series with the tropical analogues of eigenvalues. We also show that these…

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…

We study the conditional distribution of zeros of a Gaussian system of random polynomials (and more generally, holomorphic sections), given that the polynomials or sections vanish at a point p (or a fixed finite set of points). The…

We obtain in closed form averages of polynomials, taken over hermitian matrices with the Gaussian measure involved in the Kontsevich integral, and prove a conjecture of Witten enabling one to express analogous averages with the full (cubic…

Period polynomials have long been fruitful tools for the study of values of $L$-functions in the context of major outstanding conjectures. In this paper, we survey some facets of this study from the perspective of Eichler cohomology. We…

We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…

In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

A new numerical method is introduced for calculation of quasi-polynomial zeros with constant single delay. The trajectories of zeros are obtained depending on time-delay from zero to final time-delay value. The method determines all the…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…