Related papers: Polynomials with integer coefficients and their ze…
The complex or non-hermitian orthogonal polynomials with analytic weights are ubiquitous in several areas such as approximation theory, random matrix models, theoretical physics and in numerical analysis, to mention a few. Due to the…
It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…
In this paper, we investigate some properties of Chebyshev polynomials arising from non-linear differential equations. From our investigation, we derive some new and interesting identities on Chebyshev polynomials.
A complete intersection of n polynomials in n indeterminates has only a finite number of zeros. In this paper we address the following question: how do the zeros change when the coefficients of the polynomials are perturbed? In the first…
Cyclotomic polynomials play an important role in several areas of mathematics and their study has a very long history, which goes back at least to Gauss (1801). In particular, the properties of their coefficients have been intensively…
We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…
Lower bounds are given for the number of non-real zeros of a second order linear differential polynomial with constant coefficients in a real entire function with finitely many non-real zeros.
The paper deals with different properties of polynomials in random elements: bounds for characteristics functionals of polynomials, stochastic generalization of the Vinogradov mean value theorem, characterization problem, bounds for…
Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we survey some results on the…
We first give a combinatorial interpretation of coefficients of Chebyshev polynomials, which allows us to connect them with compositions of natural numbers. Then we describe a relationship between the number of compositions of a natural…
We consider random polynomials whose coefficients are independent and identically distributed on the integers. We prove that if the coefficient distribution has bounded support and its probability to take any particular value is at most…
Chebyshev varieties are algebraic varieties parametrized by Chebyshev polynomials or their multivariate generalizations. We determine the dimension, degree, singular locus and defining equations of these varieties. We explain how they play…
For systems of equations with an infinite set of roots, one can sometimes obtain Kushnirenko-Bernstein-Khovanskii type theorem if replace the number of roots by their asymptotic density. We consider systems of entire functions with…
We prove that several forms of the Bernstein polynomials with integer coefficients possess the property of simultaneous approximation, that is, they approximate not only the function but also its derivatives. We establish direct estimates…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
The purpose of this paper is to investigate some properties of q-Euler numbers and polynomials with weight 0. From those q-Euler numbers with weight 0, we derive some identities on the q-Euler numbers and polynomials with weight 0.
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…
It is known that the weight (that is, the number of nonzero coefficients) of a univariate polynomial over a field of characteristic zero is larger than the multiplicity of any of its nonzero roots. We extend this result to an appropriate…
Motivated by the question of whether a random polynomial with integer coefficients is likely to be irreducible, we study the probability that a monic polynomial with integer coefficients has a low-degree factor over the integers, which is…
We establish new results on root separation of integer, irreducible polynomials of degree at least four. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Goetze (for odd degree).