Related papers: Lower Bound for the Discrete Norm of a Polynomial …

We show a general lower bound for Mean-value of Dirichlet polynomials

We estimate the number of zeros of a polynomial in $\mathbb{C}[z]$ within any small circular disc centered on the unit circle, which improves and comprehensively extends a result established by Borwein, Erd{\'e}lyi, and Littmann~\cite{BE1}…

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…

We derive Moore-type upper bounds for regular simplicial complexes and present logarithmic lower bounds on their diameter based on minimum degree.

In this paper, we give a sharp lower bound for the minimum deviation of the Chebyshev polynomial on a compact subset of the real line in terms of the corresponding logarithmic capacity. Especially if the set is the union of several real…

This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.

We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of R^k, assuming that P is positive on the simplex. This bound depends only on the number…

We announce numerous new results in the theory of orthogonal polynomials on the unit circle.

In this paper I prove a conjecture which gives a lower bound for the largest absolute value of the coefficients of the n-th cyclotomic polynomial for some n. Moreover this estimate is essentially sharp.

In this note we investigate, as a natural continuation of [K. Castillo, Constr. Approx., 55 (2022) 605-627], the behaviour of the zeros of discrete paraorthogonal polynomials on the unit circle with respect to a real parameter.

We present a new method for obtaining norm bounds for random matrices, where each entry is a low-degree polynomial in an underlying set of independent real-valued random variables. Such matrices arise in a variety of settings in the…

We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P of Z[X_1,...,X_k] over the standard simplex, assuming that m>0. Recent algorithmic developments in real algebraic geometry enable us to obtain a…

In this note, we provide a wide range of upper bounds for the moduli of the zeros of a complex polynomial. The obtained bounds complete a series of previous papers on the location of zeros of polynomials.

We provide a lower bound on the probability that a binomial random variable is exceeding its mean. Our proof employs estimates on the mean absolute deviation and the tail conditional expectation of binomial random variables.

We estimate the error term in the asymptotic formula of the Sidon constant for (ordinary) Dirichlet polynomials by providing explicit lower and upper bounds. The lower bound is already implicitly known, but we supply the necessary…

This paper addresses the problem of deciding the lower-boundedness of an arbitrary real polynomial p in n variables.

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…

In this paper, we prove an inequality regarding the differential polynomial. This improves some recent results.

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…