Polynomials with high multiplicity at unity and Tarry's problem (Q1974377): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Arturas Dubickas / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Maurice Mignotte / rank
 
Normal rank

Revision as of 02:40, 10 February 2024

scientific article
Language Label Description Also known as
English
Polynomials with high multiplicity at unity and Tarry's problem
scientific article

    Statements

    Polynomials with high multiplicity at unity and Tarry's problem (English)
    0 references
    0 references
    14 August 2000
    0 references
    Let \(P\) be a non constant polynomial with integer coefficients of degree less than \(N\). The author denotes by \(r(P)\) the multiplicity of \(P\) at the point \(z=1\). In 1932 [Proc. Lond. Math. Soc., II. Ser. 33, 102-114 (1931; Zbl 0003.10501)] \textit{A. Bloch} and \textit{G. Pólya} proved that there exists a nonzero polynomial with coefficients in \(\{0,\pm 1\}\) such that \[ r(P) \geq \left[\sqrt {2 \log {2\log 2{N-1\over \log N}}}\,\right]-1. \] Since then this estimate has been improved several times. Here the author obtains an improvement of these results. His proof is based on an estimate of the number of solutions of Tarry's problem.
    0 references
    0 references
    Tarry's problem
    0 references
    multiplicity of roots
    0 references
    0 references