稀疏集合中的异常字符和素数

IF 0.9 1区数学 Q2 MATHEMATICS

Algebra & Number Theory Pub Date : 2024-06-13 DOI:10.2140/ant.2024.18.1305

Jori Merikoski

{"title":"稀疏集合中的异常字符和素数","authors":"Jori Merikoski","doi":"10.2140/ant.2024.18.1305","DOIUrl":null,"url":null,"abstract":"<p>We develop a lower bound sieve for primes under the (unlikely) assumption of infinitely many exceptional characters. Compared with the illusory sieve due to Friedlander and Iwaniec which produces asymptotic formulas, we show that less arithmetic information is required to prove nontrivial lower bounds. As an application of our method, assuming the existence of infinitely many exceptional characters we show that there are infinitely many primes of the form <math display=\"inline\" xmlns=\"http://www.w3.org/1998/Math/MathML\"><msup><mrow><mi>a</mi></mrow><mrow><mn>2</mn></mrow></msup>\n<mo>+</mo> <msup><mrow><mi>b</mi></mrow><mrow><mn>8</mn></mrow></msup></math>. </p>","PeriodicalId":50828,"journal":{"name":"Algebra & Number Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Exceptional characters and prime numbers in sparse sets\",\"authors\":\"Jori Merikoski\",\"doi\":\"10.2140/ant.2024.18.1305\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We develop a lower bound sieve for primes under the (unlikely) assumption of infinitely many exceptional characters. Compared with the illusory sieve due to Friedlander and Iwaniec which produces asymptotic formulas, we show that less arithmetic information is required to prove nontrivial lower bounds. As an application of our method, assuming the existence of infinitely many exceptional characters we show that there are infinitely many primes of the form <math display=\\\"inline\\\" xmlns=\\\"http://www.w3.org/1998/Math/MathML\\\"><msup><mrow><mi>a</mi></mrow><mrow><mn>2</mn></mrow></msup>\\n<mo>+</mo> <msup><mrow><mi>b</mi></mrow><mrow><mn>8</mn></mrow></msup></math>. </p>\",\"PeriodicalId\":50828,\"journal\":{\"name\":\"Algebra & Number Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Algebra & Number Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.2140/ant.2024.18.1305\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algebra & Number Theory","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2140/ant.2024.18.1305","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

我们根据无穷多例外字符（不太可能）的假设，开发了一种素数下限筛。与弗里德兰德和伊瓦尼茨提出的产生渐近公式的虚幻筛法相比，我们证明了证明非微不足道的下界所需的算术信息更少。作为我们方法的一个应用，假设存在无限多的特殊字符，我们证明存在无限多的 a2+ b8 形式的素数。

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

查看原文本刊更多论文

Exceptional characters and prime numbers in sparse sets

We develop a lower bound sieve for primes under the (unlikely) assumption of infinitely many exceptional characters. Compared with the illusory sieve due to Friedlander and Iwaniec which produces asymptotic formulas, we show that less arithmetic information is required to prove nontrivial lower bounds. As an application of our method, assuming the existence of infinitely many exceptional characters we show that there are infinitely many primes of the form $a^{2} + b^{8}$ .

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Algebra & Number Theory MATHEMATICS-

CiteScore

1.80

自引率

7.70%

发文量

审稿时长

6-12 weeks

期刊介绍： ANT’s inclusive definition of algebra and number theory allows it to print research covering a wide range of subtopics, including algebraic and arithmetic geometry. ANT publishes high-quality articles of interest to a broad readership, at a level surpassing all but the top four or five mathematics journals. It exists in both print and electronic forms. The policies of ANT are set by the editorial board — a group of working mathematicians — rather than by a profit-oriented company, so they will remain friendly to mathematicians'' interests. In particular, they will promote broad dissemination, easy electronic access, and permissive use of content to the greatest extent compatible with survival of the journal. All electronic content becomes free and open access 5 years after publication.