论马丁关于平均和短字符和的猜想

IF 0.9 3区数学 Q2 MATHEMATICS

Bulletin of the London Mathematical Society Pub Date : 2025-05-23 DOI:10.1112/blms.70103

Oleksiy Klurman, Igor E. Shparlinski, Joni Teräväinen

{"title":"论马丁关于平均和短字符和的猜想","authors":"Oleksiy Klurman, Igor E. Shparlinski, Joni Teräväinen","doi":"10.1112/blms.70103","DOIUrl":null,"url":null,"abstract":"Let <math>\n <semantics>\n <mrow>\n <msub>\n <mi>N</mi>\n <mi>a</mi>\n </msub>\n <mrow>\n <mo>(</mo>\n <mi>x</mi>\n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation>$N_a(x)$</annotation>\n </semantics></math> denote the number of primes up to <math>\n <semantics>\n <mi>x</mi>\n <annotation>$x$</annotation>\n </semantics></math> for which the integer <math>\n <semantics>\n <mi>a</mi>\n <annotation>$a$</annotation>\n </semantics></math> is a primitive root. We show that <math>\n <semantics>\n <mrow>\n <msub>\n <mi>N</mi>\n <mi>a</mi>\n </msub>\n <mrow>\n <mo>(</mo>\n <mi>x</mi>\n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation>$N_a(x)$</annotation>\n </semantics></math> satisfies the asymptotic predicted by Artin's conjecture for almost all <math>\n <semantics>\n <mrow>\n <mn>1</mn>\n <mo>⩽</mo>\n <mi>a</mi>\n <mo>⩽</mo>\n <mi>exp</mi>\n <mo>(</mo>\n <msup>\n <mrow>\n <mo>(</mo>\n <mi>log</mi>\n <mi>log</mi>\n <mi>x</mi>\n <mo>)</mo>\n </mrow>\n <mn>2</mn>\n </msup>\n <mo>)</mo>\n </mrow>\n <annotation>$1\\leqslant a\\leqslant \\exp ((\\log \\log x)^2)$</annotation>\n </semantics></math>. This improves on a result of Stephens (1969). A key ingredient in the proof is a new short character sum estimate over the integers, improving on the range of a result of Garaev (2006).","PeriodicalId":55298,"journal":{"name":"Bulletin of the London Mathematical Society","volume":"57 8","pages":"2429-2443"},"PeriodicalIF":0.9000,"publicationDate":"2025-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://londmathsoc.onlinelibrary.wiley.com/doi/epdf/10.1112/blms.70103","citationCount":"0","resultStr":"{\"title\":\"On Artin's conjecture on average and short character sums\",\"authors\":\"Oleksiy Klurman, Igor E. Shparlinski, Joni Teräväinen\",\"doi\":\"10.1112/blms.70103\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let <math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>N</mi>\\n <mi>a</mi>\\n </msub>\\n <mrow>\\n <mo>(</mo>\\n <mi>x</mi>\\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n <annotation>$N_a(x)$</annotation>\\n </semantics></math> denote the number of primes up to <math>\\n <semantics>\\n <mi>x</mi>\\n <annotation>$x$</annotation>\\n </semantics></math> for which the integer <math>\\n <semantics>\\n <mi>a</mi>\\n <annotation>$a$</annotation>\\n </semantics></math> is a primitive root. We show that <math>\\n <semantics>\\n <mrow>\\n <msub>\\n <mi>N</mi>\\n <mi>a</mi>\\n </msub>\\n <mrow>\\n <mo>(</mo>\\n <mi>x</mi>\\n <mo>)</mo>\\n </mrow>\\n </mrow>\\n <annotation>$N_a(x)$</annotation>\\n </semantics></math> satisfies the asymptotic predicted by Artin's conjecture for almost all <math>\\n <semantics>\\n <mrow>\\n <mn>1</mn>\\n <mo>⩽</mo>\\n <mi>a</mi>\\n <mo>⩽</mo>\\n <mi>exp</mi>\\n <mo>(</mo>\\n <msup>\\n <mrow>\\n <mo>(</mo>\\n <mi>log</mi>\\n <mi>log</mi>\\n <mi>x</mi>\\n <mo>)</mo>\\n </mrow>\\n <mn>2</mn>\\n </msup>\\n <mo>)</mo>\\n </mrow>\\n <annotation>$1\\\\leqslant a\\\\leqslant \\\\exp ((\\\\log \\\\log x)^2)$</annotation>\\n </semantics></math>. This improves on a result of Stephens (1969). A key ingredient in the proof is a new short character sum estimate over the integers, improving on the range of a result of Garaev (2006).\",\"PeriodicalId\":55298,\"journal\":{\"name\":\"Bulletin of the London Mathematical Society\",\"volume\":\"57 8\",\"pages\":\"2429-2443\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2025-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://londmathsoc.onlinelibrary.wiley.com/doi/epdf/10.1112/blms.70103\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of the London Mathematical Society\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://londmathsoc.onlinelibrary.wiley.com/doi/10.1112/blms.70103\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of the London Mathematical Society","FirstCategoryId":"100","ListUrlMain":"https://londmathsoc.onlinelibrary.wiley.com/doi/10.1112/blms.70103","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

设N a (x) $N_a(x)$表示x以下质数的个数$x$其中整数a$a$是一个原始根。我们证明了na (x) $N_a(x)$对于几乎所有的1≤a都满足由Artin猜想预测的渐近≤exp ((log log x) 2) $1\leqslant a\leqslant \exp ((\log \log x)^2)$。这改进了Stephens（1969）的结果。证明中的一个关键因素是一个新的整数短字符和估计，改进了Garaev（2006）的结果的范围。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

On Artin's conjecture on average and short character sums

查看原文本刊更多论文

On Artin's conjecture on average and short character sums

Let $N_{a} (x)$ denote the number of primes up to $x$ for which the integer $a$ is a primitive root. We show that $N_{a} (x)$ satisfies the asymptotic predicted by Artin's conjecture for almost all $1 ⩽ a ⩽ \exp ({(\log \log x)}^{2})$ . This improves on a result of Stephens (1969). A key ingredient in the proof is a new short character sum estimate over the integers, improving on the range of a result of Garaev (2006).