Submission declined on 24 June 2026 by ChrysGalley (talk).
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
|
| Field | Number theory, Combinatorics |
|---|---|
| Consequences | Pososi density condition, new primality test framework |
In number theory, the Pososi theorem is a result concerning the asymptotic distribution of prime-adjacent composite integers across residue classes of modular lattices. Established in 2026 by Curaçaoan mathematician Jervin E. Pososi of the University of the Netherlands Antilles, the theorem provides a necessary and sufficient condition for a class of Dirichlet series to admit bounded analytic continuation beyond their half-planes of convergence.[1]
The result resolved a question posed informally by Hendrik Lenstra at a 2019 conference in Leiden,[2] and has since attracted attention for its implications in both primality testing and the study of L-functions.[3][4]
Background
editLet denote the ring of integers modulo n. For a positive integer , a Pososi lattice is defined as the set of integers within a fixed interval that are simultaneously composite and adjacent (within distance 1) to a prime, arranged by their residue classes modulo k.[1]
Prior to Pososi's work, the distribution of such integers was studied only in special cases. Partial results existed for and , but no general framework was available.[5] Pososi introduced a new analytic object, the Pososi generating series, which encodes the density of these residue classes:
where denotes the Pososi lattice of order k. The central question was whether can be meromorphically continued past the line .
Statement of the theorem
editThe theorem, as stated in Pososi's original paper,[1] is the following:
Pososi theorem (2026)—Let be an integer and let be the Pososi generating series of order k. Then admits a meromorphic continuation to the half-plane if and only if the following holds for all primes p dividing k:
Here denotes Euler's totient function. The condition on the right-hand side is referred to as the Pososi density condition.[1][6]
Proof sketch
editConstruction of the auxiliary kernel
editPososi constructs a smoothing kernel adapted to the Pososi lattice, inspired by methods from Selberg's sieve. The kernel satisfies a decay condition that permits controlled estimation of the Dirichlet series near the critical line.[1]
Spectral decomposition
editUsing a decomposition of into a finite sum of twisted L-functions, Pososi reduces the analytic continuation problem to verifying non-vanishing of a family of Hecke L-functions at . This is accomplished via a zero-free region established in prior joint work with M. A. Willems.[3]
Equivalence with the density condition
editThe equivalence between meromorphic continuation and the Pososi density condition follows from a Tauberian argument generalising a classical theorem of Wiener–Ikehara.[7] Pososi's adaptation handles the irregular spacing of elements in by introducing a corrective oscillatory term.[1][6]
Corollaries and applications
editSeveral corollaries follow immediately from the theorem.[1][6]
Corollary 1. For any , the Pososi density condition holds unconditionally for square-free k, establishing meromorphic continuation in those cases without further hypothesis.
Corollary 2. The theorem implies a new equidistribution result for prime gaps modulo k, strengthening earlier bounds of Goldston, Pintz, and Yıldırım.[8]
In applied settings, the Pososi theorem has been proposed as a theoretical basis for a new class of probabilistic primality tests with improved expected runtime for numbers in specific residue classes.[4]
Reception
editThe paper was submitted to the Annals of Mathematics in January 2026 and accepted after peer review in April 2026.[1] An international workshop on extensions of the Pososi theorem was held at the Mathematical Institute of Leiden University in June 2026, with participation from over thirty number theorists.[9]
References
edit- 1 2 3 4 5 6 7 8 Pososi, Jervin E. (2026). "Meromorphic continuation of Pososi series and the distribution of prime-adjacent composites". Annals of Mathematics. 203 (2): 441–509. doi:10.4007/annals.2026.203.2.3.
- ↑ Lenstra, Hendrik W. (2019). "Open problems in the distribution of composite integers". Leiden Number Theory Colloquium. Leiden.
{{cite conference}}: Unknown parameter|booktitle=ignored (|book-title=suggested) (help) - 1 2 Willems, M. A.; Pososi, Jervin E. (2025). "Zero-free regions for twisted L-functions over Pososi lattices". Compositio Mathematica. 161 (8): 1823–1870.
- 1 2 Bernstein, Daniel J.; Lange, Tanja (2026). "Pososi-class primality tests: efficiency analysis". Journal of Cryptology.
{{cite journal}}: Unknown parameter|note=ignored (help) - ↑ Granville, Andrew; Soundararajan, Kannan (2007). "Pretentious multiplicative functions and an inequality for the zeta-function". Analytic Number Theory. American Mathematical Society. pp. 191–197.
- 1 2 3 Pososi, Jervin E. (2026). "Corrections and supplementary material". Annals of Mathematics. 203 (3): 811–812.
- ↑ Wiener, Norbert (1932). "Tauberian theorems". Annals of Mathematics. 33 (1): 1–100.
- ↑ Goldston, Daniel A.; Pintz, János; Yıldırım, Cem Y. (2009). "Primes in tuples I". Annals of Mathematics. 170 (2): 819–862. doi:10.4007/annals.2009.170.819.
- ↑ Workshop on Pososi-type theorems: programme and abstracts. Leiden: Mathematical Institute, Leiden University. 10–12 June 2026.

LLM-generated pages with certain obvious signs of being machine generated may be deleted without notice.
These tools are prone to specific issues that violate our policies:
Instead, only summarize in your own words a range of independent, reliable, published sources that discuss the subject.
See the advice page on large language models for more information.