Littlewood Pisot numbers

Mukunda, Keshav

doi:10.1016/j.jnt.2005.05.009

Cited by 22 publications

(22 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is often stated as an equivalent question about "reciprocal polynomials" [6]. In this setting, it is also believed that the number of zeros tends to infinity with the degree [29]. So far, several partial results have been obtained.…”

Section: A Structure Theorem For Trigonometric Polynomials With Few Rmentioning

confidence: 99%

Counting zeros of cosine polynomials: On a problem of Littlewood

Sahasrabudhe

2019

Advances in Mathematics

View full text Add to dashboard Cite

We show that if A is a finite set of non-negative integers then the number of zeros of the function f A (θ) = a∈A cos(aθ), in [0, 2π], is at least (log log log |A|) 1/2−ε . This gives the first unconditional lower bound on a problem of Littlewood and solves a conjecture of Borwein, Erdélyi, Ferguson and Lockhart. We also prove a result that applies to more general cosine polynomials with few distinct rational coefficients. One of the main ingredients in the proof is perhaps of independent interest: we show that if f is an exponential polynomial with few distinct integer coefficients and f "correlates" with a low-degree exponential polynomial P , then f has a very particular structure. This result allows us to prove a structure theorem for trigonometric polynomials with few zeros in [0, 2π] and restricted coefficents.is well known that any continuous, even function f : R/(2πZ) → R can be uniformly approximated by cosine polynomials. Thus, for large N , the behavior of such polynomials is essentially as rich as the class of continuous functions. In what follows, we consider what can be said about the behavior of the function f if the coefficients are restricted to a small set.One of the early champions of questions about polynomials with restricted coefficients was J.E.Littlewood, who studied many problems of this general type and stimulated the field with a wealth of problems [23,24,25,26]. Perhaps most famously, Littlewood asked for the minimum L 1 -norm attained by a function of the form a∈A cos(aθ), where A ⊆ N ∪ {0} is of a given size. This question was resolved (up to constants) in 1981 independently by Konyagin [22], and McGehee, Pigno, and Smith [28] after a series of partial results were obtained by Salem, Cohen, Davenport and Pichorides [33,8,9,32]. We note that these estimates have seen numerous applications and modifications in recent years.Counting zeros of polynomials with restricted coefficients has also received considerable attention;after the seminal work of Littlewood and Offord [27], several results have been proved on the number of roots of "typical" polynomials with restricted coefficients. For example, Kac [20,21] has given an exact integral formula for the expected number of roots of a degree N polynomial with coefficients sampled identically and independently from a Gaussian distribution. In a similar vein, Erdős and Offord [15] showed that almost all polynomials of the form N i=0 ε i x i , where ε 0 , . . . , ε N ∈ {−1, +1}, have ( 2 π + o(1)) log N real roots. These results have been subsequently refined and extended by various authors. For more, we refer the reader to the recent paper of Hoi Nguyen, Oanh Nguyen and Van Vu [30].The study of extremal questions on the number of real zeros of polynomials with restricted coefficients began with the work of Bloch and Pólya [2] in 1932, who studied the maximum number of real zeros attainable by polynomials of the form N i=0 ε i x i , ε 0 , . . . , ε N ∈ {−1, 0, +1}. After improvements by other authors [34,35], Erdős and Turán proved a landmark ...

show abstract

Section: A Structure Theorem For Trigonometric Polynomials With Few Rmentioning

confidence: 99%

Counting zeros of cosine polynomials: On a problem of Littlewood

Sahasrabudhe

2019

Advances in Mathematics

View full text Add to dashboard Cite

show abstract

“…studied the distribution of the zeros of PSR polynomials with a small perturbation in their coefficients. Real SR polynomials of height 1 -namely, special cases of Littlewood, Newman and Borwein polynomials -were studied by several authors, see [27][28][29][30][31][32][33][34][35] and references therein 2 . Zeros of the so-called Ramanujan Polynomials and generalizations were analyzed in [37][38][39].…”

Section: Real Self-reciprocal Polynomialsmentioning

confidence: 99%

Polynomials with Symmetric Zeros

Vieira

2019

Polynomials - Theory and Application

View full text Add to dashboard Cite

Polynomials whose zeros are symmetric either to the real line or to the unit circle are very important in mathematics and physics. We can classify them into three main classes: the self-conjugate polynomials, whose zeros are symmetric to the real line; the self-inversive polynomials, whose zeros are symmetric to the unit circle; and the self-reciprocal polynomials, whose zeros are symmetric by an inversion with respect to the unit circle followed by a reflection in the real line. Real selfreciprocal polynomials are simultaneously self-conjugate and self-inversive so that their zeros are symmetric to both the real line and the unit circle. In this survey, we present a short review of these polynomials, focusing on the distribution of their zeros.

show abstract

“…Some other classical bounds can be found in [11], [12], and [14]. The following theorem and lemma which are respectively proved in [9] and [13] have key role in the proof of the theorem (Theorem 3.1) about the number of zeros of reciprocal Littlewood polynomials on the unit circle. …”

Section: On the Location Of Zeros Of Polynomialsmentioning

confidence: 99%

Polynomials with coefficients from a finite set

Baradaran

Taghavi

2014

Mathematica Slovaca

View full text Add to dashboard Cite

ABSTRACT. This paper focuses on the problem concerning the location and the number of zeros of those polynomials when their coefficients are restricted with special conditions. The problem of the number of the zeros of reciprocal Littlewood polynomials on the unit circle T is discussed, the interest on bounds for the number of the zeros of reciprocal polynomials on the unit circle arose after 1950 when Erdös began introducing problems on zeros of various types of polynomials. Our main result is the problem of finding the number of zeros of complex polynomials in an open disk.

show abstract

Littlewood Pisot numbers

Cited by 22 publications

References 8 publications

Counting zeros of cosine polynomials: On a problem of Littlewood

Counting zeros of cosine polynomials: On a problem of Littlewood

Polynomials with Symmetric Zeros

Polynomials with coefficients from a finite set

Contact Info

Product

Resources

About