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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Roots of Certain Algebraic Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Thue-Siegel-Dyson theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Siegel's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a question of Lehmer and the number of irreducible factors of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: On algebraic numbers of small measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3255445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on Vinogradov's mean value theorem and Tarry's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3778820 / rank
 
Normal rank

Latest revision as of 15:41, 29 May 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