English
Related papers

Related papers: Polynomials with integer coefficients and their ze…

200 papers

We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials.…

Classical Analysis and ODEs · Mathematics 2013-07-23 Igor E. Pritsker

We begin by considering a sequence of polynomials in three variables whose coefficients count restricted binary overpartitions with certain properties. We then concentrate on two specific subsequences that are closely related to the…

Combinatorics · Mathematics 2024-05-21 Karl Dilcher , Larry Ericksen

The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…

Number Theory · Mathematics 2013-07-23 P. B. Borwein , I. E. Pritsker

Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…

Probability · Mathematics 2014-07-28 Igor E. Pritsker , Aaron M. Yeager

We consider the integer Chebyshev problem, that of minimizing the supremum norm over polynomials with integer coefficients on the interval $[0,1]$. We implement algorithms from semi-infinite programming and a branch and bound algorithm to…

Number Theory · Mathematics 2018-10-29 Kevin G. Hare , Philip W. Hodges

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…

Number Theory · Mathematics 2024-01-17 Jitender Singh , Rishu Garg

In this paper, we are concerned with the problem of locating the zeros of polynomials of a quaternionic variable with quaternionic coefficients. We derive some new Cauchy bounds for the zeros of a polynomial by virtue of maximum modulus…

Complex Variables · Mathematics 2025-02-25 N. A. Rather , Tanveer Bhat

We describe the limit zero distributions of sequences of polynomials with positive coefficients.

Complex Variables · Mathematics 2018-01-08 Alexandre Eremenko , Walter Bergweiler

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…

Complex Variables · Mathematics 2025-01-29 Ozan Günyüz

In this paper we present some classes of real self-reciprocal polynomials with at most two zeros outside the unit circle which are connected with a Chebyshev quasi-orthogonal polynomials of order one. We investigated the distribution,…

Classical Analysis and ODEs · Mathematics 2017-09-12 Vanessa Botta

In this article, we give an account of some recent irreducibility testing criteria for polynomials having integer coefficients over the field of rational numbers.

Number Theory · Mathematics 2023-10-05 Sanjeev Kumar , Jitender Singh

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

Mathematical Physics · Physics 2017-06-13 Francesco Calogero , Francois Leyvraz

We investigate an infinite sequence of polynomials of the form: \[a_0T_{n}(x)+a_{1}T_{n-1}(x)+\cdots+a_{m}T_{n-m}(x)\] where $(a_0,a_1,\ldots,a_m)$ is a fixed m-tuple of real numbers, $a_0,a_m\ne0$, $T_i(x)$ are Chebyshev polynomials of the…

Number Theory · Mathematics 2015-07-01 Dragan Stankov

We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…

Number Theory · Mathematics 2009-06-11 Lenny Fukshansky

The discriminants of certain polynomials related to Chebyshev polynomials factor into the product of two polynomials, one of which has coefficients that are much larger than the other's. Remarkably, these polynomials of dissimilar size have…

Complex Variables · Mathematics 2016-01-19 Khang Tran

The subject matter of this work is quadratic and cubic polynomial functions with integer coefficients;and all of whose roots are integers. The material of this work is directed primarily at educators,students,and teachers of…

General Mathematics · Mathematics 2011-10-28 Konstantine Zelator

Using Chebyshev polynomialsof both kinds, we construct rational fractions which are convergents of the smallest root of $x^2-\alpha x+1$ for $\alpha=3,4,5,\dots$.Some of the underlying identities suggest an identity involving…

Combinatorics · Mathematics 2015-10-01 Roland Bacher

A class P_{n,m,p}(x) of polynomials is defined. The combinatorial meaning of its coefficients is given. Chebyshev polynomials are the special cases of P_{n,m,p}(x). It is first shown that P_{n,m,p}(x) may be expressed in terms of…

Complex Variables · Mathematics 2008-04-15 Milan Janjic

We study the number of real zeros of trigonometric polynomials in a period and the number of zeros of self-reciprocal algebraic polynomials on the unit circle under the assumption that their coefficients are in a fixed finite set of real…

Classical Analysis and ODEs · Mathematics 2016-02-09 Tamas Erdelyi

Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…

Number Theory · Mathematics 2007-05-23 Jean-Claude Evard
‹ Prev 1 2 3 10 Next ›