20 citations · 21 across the 10 of their papers we have counts for
Showing math.NTShow all
3 papers · 1 filter
math.NT2017
Improved lower bound for the number of unimodular zeros of self-reciprocal polynomials with coefficients in a finite set
Tamás Erdélyi
Let be non-negative integers. In a private communication Brian Conrey asked how fast the number of real zeros of the trigonometric polynomials $T_N(θ) =…
math.NT2014★ 1 cited
Coppersmith-Rivlin type inequalities and the order of vanishing of polynomials at 1
Tamas Erdelyi
We examine the maximal number of zeros a polynomial of degree at most n with constrained coefficients may have at 1. Our results are essentially sharp and extend earlier results of…
math.NT2012
A note on Barker polynomials
Peter Borwein, Tamas Erdelyi
We give a new proof of the fact that Barker polynomials of even degree greater than 12, and hence Barker sequences of odd length greater than 13 do not exist. This is intimately ti…