{"title":"On nonzero coefficients of binary cyclotomic polynomials","authors":"Igor E. Shparlinski , Laurence P. Wijaya","doi":"10.1016/j.jnt.2024.11.008","DOIUrl":null,"url":null,"abstract":"<div><div>Let <span><math><mi>ϑ</mi><mo>(</mo><mi>m</mi><mo>)</mo></math></span> be the number of nonzero coefficients in the <em>m</em>-th cyclotomic polynomial. For real <span><math><mi>γ</mi><mo>></mo><mn>0</mn></math></span> and <span><math><mi>x</mi><mo>≥</mo><mn>2</mn></math></span> we define<span><span><span><math><mrow><msub><mrow><mi>H</mi></mrow><mrow><mi>γ</mi></mrow></msub><mo>(</mo><mi>x</mi><mo>)</mo><mo>=</mo><mi>#</mi><mrow><mo>{</mo><mi>m</mi><mo>:</mo><mspace></mspace><mi>m</mi><mo>=</mo><mi>p</mi><mi>q</mi><mo>≤</mo><mi>x</mi><mo>,</mo><mspace></mspace><mi>p</mi><mo><</mo><mi>q</mi><mtext> primes </mtext><mo>,</mo><mspace></mspace><mi>ϑ</mi><mo>(</mo><mi>m</mi><mo>)</mo><mo>≤</mo><msup><mrow><mi>m</mi></mrow><mrow><mn>1</mn><mo>/</mo><mn>2</mn><mo>+</mo><mi>γ</mi></mrow></msup><mo>}</mo></mrow></mrow><mo>,</mo></math></span></span></span> and show that for any fixed <span><math><mi>η</mi><mo>></mo><mn>0</mn></math></span>, uniformly over <em>γ</em> with<span><span><span><math><mn>9</mn><mo>/</mo><mn>20</mn><mo>+</mo><mi>η</mi><mo>≤</mo><mi>γ</mi><mo>≤</mo><mn>1</mn><mo>/</mo><mn>2</mn><mo>−</mo><mi>η</mi><mo>,</mo></math></span></span></span> we have an asymptotic formula<span><span><span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>γ</mi></mrow></msub><mo>(</mo><mi>x</mi><mo>)</mo><mo>∼</mo><mi>C</mi><mo>(</mo><mi>γ</mi><mo>)</mo><msup><mrow><mi>x</mi></mrow><mrow><mn>1</mn><mo>/</mo><mn>2</mn><mo>+</mo><mi>γ</mi></mrow></msup><mo>/</mo><mi>log</mi><mo></mo><mi>x</mi><mo>,</mo><mspace></mspace><mi>x</mi><mo>→</mo><mo>∞</mo><mo>,</mo></math></span></span></span> where <span><math><mi>C</mi><mo>(</mo><mi>γ</mi><mo>)</mo><mo>></mo><mn>0</mn></math></span> is an explicit constant depending only on <em>γ</em>. This extends the previous result of É. Fouvry (2013), which has 12/25 instead of 9/20. This improvement is based on new ingredient including work of W. Duke, J. Friedlander and H. Iwaniec (1997).</div></div>","PeriodicalId":50110,"journal":{"name":"Journal of Number Theory","volume":"271 ","pages":"Pages 246-258"},"PeriodicalIF":0.6000,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Number Theory","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022314X25000058","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
Let be the number of nonzero coefficients in the m-th cyclotomic polynomial. For real and we define and show that for any fixed , uniformly over γ with we have an asymptotic formula where is an explicit constant depending only on γ. This extends the previous result of É. Fouvry (2013), which has 12/25 instead of 9/20. This improvement is based on new ingredient including work of W. Duke, J. Friedlander and H. Iwaniec (1997).
期刊介绍:
The Journal of Number Theory (JNT) features selected research articles that represent the broad spectrum of interest in contemporary number theory and allied areas. A valuable resource for mathematicians, the journal provides an international forum for the publication of original research in this field.
The Journal of Number Theory is encouraging submissions of quality, long articles where most or all of the technical details are included. The journal now considers and welcomes also papers in Computational Number Theory.
Starting in May 2019, JNT will have a new format with 3 sections:
JNT Prime targets (possibly very long with complete proofs) high impact papers. Articles published in this section will be granted 1 year promotional open access.
JNT General Section is for shorter papers. We particularly encourage submission from junior researchers. Every attempt will be made to expedite the review process for such submissions.
Computational JNT . This section aims to provide a forum to disseminate contributions which make significant use of computer calculations to derive novel number theoretic results. There will be an online repository where supplementary codes and data can be stored.