Partition-theoretic model of prime distribution
The authors propose a deterministic model for the distribution of prime numbers based on ideas from partition theory. Using multiplicative partition statistics, in particular the partition norm and the supernorm, they construct a framework in which prime gaps are interpreted combinatorially via partitions mapped to integers under the supernorm. This viewpoint leads to a heuristic relation for prime gaps involving the divisor function, which in turn yields a model for the \(n\)-th prime number.\N\NThe initial model predicts the asymptotic behavior \(p_n \sim n\log n\) and therefore is compatible with the prime number theorem. It also produces qualitative predictions about the behavior of prime gaps and suggests a connection with the twin prime phenomenon. To improve numerical accuracy, the authors introduce refined models that incorporate correction terms based on semiprime counts and asymptotic estimates, resulting in computational approximations to \(\pi(n)\) that compare favorably with classical estimates such as the logarithmic integral for moderately large \(n\).\N\NThe paper combines combinatorial ideas from partition theory with computational experiments to explore this proposed framework. While the model is heuristic in nature, it offers an interesting perspective on prime distribution and suggests further questions about the interaction between partition statistics and multiplicative number theory.
- A ``supernormal partition statistic
- A Direct Interpretation of Gandhi's Formula
- Algebra of overpartitions
- Almost-primes in arithmetic progressions and short intervals
- Analytic study of norms of prime partitions
- Arithmetic of partitions and the q-bracket operator
- Asymptotics of reciprocal supernorm partition statistics
- Characterizing the supernorm partition statistic
- Explorations in the theory of partition zeta functions
- Handbuch der Lehre von der Verteilung der Primzahlen. Erster Band.
- scientific article; zbMATH DE number 5509797 (Why is no real title available?)
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- scientific article; zbMATH DE number 2038304 (Why is no real title available?)
- scientific article; zbMATH DE number 1465089 (Why is no real title available?)
- scientific article; zbMATH DE number 7633011 (Why is no real title available?)
- scientific article; zbMATH DE number 3361954 (Why is no real title available?)
- Integer partitions detect the primes
- Introduction to analytic and probabilistic number theory. Transl. from the 3rd French edition by Patrick D. F. Ion
- Jacobi's triple product, mock theta functions, unimodal sequences and the q-bracket
- MacMahonesque partition functions detect sets related to primes
- On an additive arithmetic function
- On the counting function of semiprimes
- Overpartitions
- Partition identities
- Partition zeta functions
- Partition-theoretic formulas for arithmetic densities
- Partition-theoretic formulas for arithmetic densities. II
- Partition-theoretic Frobenius-type limit formulas
- Partitions, quasimodular forms, and the Bloch-Okounkov theorem
- Pretentious multiplicative functions and an inequality for the zeta-function.
- Prime clusters and Cunningham chains
- Sur la distribution des nombres premiers.
- The \(n\)-th prime is greater than \(n \log n\).
- The partition function \(p(n)\) in terms of the classical Möbius function
- The product of parts or ``norm of a partition
This page was built for publication: Partition-theoretic model of prime distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6850749)
