Erika Alvarez, Jean Pestieau
Let pi(x) denote the number of primes smaller or equal to x. We compare sqrt{pi}(x) with sqrt{R}(x) and sqrt{li}(x), where R(x) and li(x) are the Riemann function and the logarithmic integral, respectively. We show a regularity in the distribution of the natural numbers in terms of a phase related to sqrt{pi}-sqrt{R} and indicate how li(x) can cross pi(x) for the first time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Prime number related fractal polygons and curves are derived by combining two different aspects. One is an approximation of the prime counting function build on an additive function. The other are prime number indexed basis entities taken from the discrete or continuous Fourier basis.
Let $f$ be a Rademacher or a Steinhaus random multiplicative function. Let $\varepsilon>0$ small. We prove that, as $x\rightarrow +\infty$, we almost surely have $$\bigg|\sum_{\substack{n\leq x\\ P(n)>\sqrt{x}}}f(n)\bigg|\leq\sqrt{x}(\log\log x)^{1/4+\varepsilon},$$ where $P(n)$ stands for the largest prime factor of $n$. This gives an indication of the almost sure size of the largest fluctuations of $f$.
Random Diophantine Equations in the Primes
研究素数解的存在性，提出素数哈塞原理，证明当s≥3k+2时几乎所有此类方程有解，并给出反例显示哈塞-米诺夫斯基定理的素数解版本失效。
Poisson Approximation of prime divisors of shifted primes
本文研究了移位素数的素因数分布，通过建立模型与实际素因数的总变差距离估计，证明了移位素数素因数在不相交集合中的泊松独立性，并建立了随机整数与移位素数的结构转移原理。
An interesting question, known as the Gaussian moat problem, asks whether it is possible to walk to infinity on Gaussian primes with steps of bounded length. Our work examines a similar situation in the real quadratic integer ring $\mathbb{Z}[\sqrt{2}]$ whose primes cluster near the asymptotes $y = \pm x/\sqrt{2}$ as compared to Gaussian primes, which cluster near the origin. We construct a probabilistic model of primes in $\mathbb{Z}[\sqrt{2}]$ by applying the prime number theorem and a combinatorial theorem for counting the number of lattice points whose absolute values of their norms are at…
In recent work, we considered the frequencies of patterns of consecutive primes $\pmod{q}$ and numerically found biases toward certain patterns and against others. We made a conjecture explaining these biases, the dominant factor in which permits an easy description but fails to distinguish many patterns that have seemingly very different frequencies. There was a secondary factor in our conjecture accounting for this additional variation, but it was given only by a complicated expression whose distribution was not easily understood. Here, we study this term, which proves to be connected to bot…
Random Diophantine Equations in the Primes II
研究素数中高斯丢番图方程的局部-全局原理，采用Browning等人的方法扩展前人工作。
Transcendental nature of $p$-adic digamma values
本文推广了前人关于$p$进双伽马函数特殊值超越性的研究至不同素数幂情形，还通过满足条件的分圆数乘法独立性，证明了$p$、$q$为不同素数时$ψ_p(r/pq)+ γ_p$的超越性。
For a prime $p$ we define the Paley graph to be the graph with the set of vertices $\mathbb{Z}/p\mathbb{Z}$, and with edges connecting vertices whose sum is a quadratic residue. Paley graphs are notoriously difficult to study, particularly finding bounds for their clique numbers. For this reason, it is desirable to have a random model. A well known result of Graham and Ringrose shows that the clique number of the Paley graph is $Ω(\log p\log\log\log p)$ (even $Ω(\log p\log\log p)$, under the generalized Riemann hypothesis) for infinitely many primes $p$ -- a behaviour not detected by the rando…
Heuristic Bounded Prime Gaps via a Chaotic Multidimensional Sieve and Random Matrix Theory
本文提出融合混沌扰动与RMT的EMCHS概率筛框架，在GPY与Maynard筛法基础上启发式改进素数间隙界，并用数值证据与部分严格证明加以支撑。
How much dependence is there in the prime factorization of a random integer distributed uniformly from 1 to n? How much dependence is there in the decomposition into cycles of a random permutation of n points? What is the relation between the Poisson-Dirichlet process and the scale invariant Poisson process? These three questions have essentially the same answers, with respect to total variation distance, considering only small components, and with respect to a Wasserstein distance, considering all components. The Wasserstein distance is the expected number of changes -- insertions and deletio…
We present here a new conjecture for the nature of the Mersenne prime numbers by connecting it with the Collatz-Kakutani problem. By introducing a natural path length on the basis of the Collatz-Kakutani tree, we conjecture that this path length of a Mersenne prime from the root of the Collatz-Kakutani tree is approximately proportional to the index of the Mersenne prime. We also discuss difference of behaviors between Mersenne numbers and Mersenne primes.
One aspect of Chebyshev's bias is the phenomenon that a prime number, $ q $, modulo another prime number, $ p$, experimentally seems to be slightly more likely to be a nonquadratic residue than a quadratic residue. We thought it would be interesting to model this residue bias as a "random" walk using Legendre symbol values as steps. Such a model would allow us to easily visualize the bias. In addition, we would be able to extend our model to other number fields. In this report, we first outline underlying theory and some motivations for our research. In the second section, we present our findi…
We establish an asymptotic formula for the number of k-difference twin primes associated with the Hawkins random sieve, which is a probabilistic model of the Eratosthenes sieve. The formula for k=1 was obtained by Wunderlich [Acta Arith. 26 (1974), 59--81]. We here extend this to k \geq 2 and generalize it to all l-tuples of Hawkins primes.
The distribution of prime values of random polynomials
研究随机多项式素数取值分布，证明多项式满足Bateman-Horn猜想及Poisson尾猜想，揭示符号模式极限分布。
We suggest other models of sieve generated sequences like the Sieve of Eratosthenes to explain randomness properties of the prime numbers, like the twin prime conjecture, the lim sup conjecture, the Riemann conjecture, and the prime number theorem.
The prime numbers look like a randomly chosen sequence of natural numbers, but there is still no strict theory to determine 'Randomness'. In these years, cryptography has developed a battery of statistical tests for randomness. In this paper, we just apply these methods to study the distribution of primes. Here the binary sequence constructed by second difference of primes is used as samples. We find this sequence can't reach all the 'random standard' of FIPS 140-1/2, but still show obvious random feature. The interesting self-similarity is also observed in this sequence. These results add the…
An s-tuple of positive integers are k-wise relatively prime if any k of them are relatively prime. Exact formula is obtained for the probability that s positive integers are k-wise relatively prime.
We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained by considering three probabilistic models are similar. It is shown that the accuracy of these probabilistic models exceeds the Riemann hypothesis with a certain probability. The author constructed probabilistic models for the analysis of the average distance between neighboring prime numbers and k-tuples and found probability distributions of these random var…
It is well known that the arithmetic nature of Mills' prime-representing constant is uncertain: we do not know if Mills' constant is a rational or irrational number. In the case of other prime-representing constants, irrationality can be proved, but it is not known whether these constants are algebraic or transcendental numbers. By using Liouville or Roth's theorems about approximation by rationals, we find a couple of prime-representing constants that can be proved to be transcendental numbers.
We describe a straightforward method to generate a random prime q such that the multiplicative group GF(q)* also has a random large prime-order subgroup. The described algorithm also yields this order p as well as a p'th primitive root of unity. The methods here are efficient asymptotically, but due to large constants may not be very useful in practical settings.
Given disjoint subsets $T_1,\ldots,T_m$ of "not too large" primes up to $x$, we establish that for a random integer $n$ drawn from $[1,x]$, the $m$-dimensional vector enumerating the number of prime factors of $n$ from $T_1,\ldots,T_m$ converges to a vector of $m$ independent Poisson random variables. We give a specific rate of convergence using the Kubilius model of prime factors. We also show a universal upper bound of Poisson type when $T_1,\ldots,T_m$ are unrestricted, and apply this to the distribution of the number of prime factors from a set $T$ given that $n$ has $k$ total prime factor…
In recent years, computer simulations are playing a fundamental role in unveiling some of the most intriguing features of prime numbers. In this work, we define an algorithm for a deterministic walk through a two-dimensional grid that we refer to as Prime Walk. The walk is constructed from a sequence of steps dictated by and dependent on the sequence of last digits of the primes. Despite the apparent randomness of this generating sequence, the resulting structure -- both in 2d and 3d -- created by the algorithm presents remarkable properties and regularities in its pattern that we proceed to a…
Any ideal in a number field can be factored into a product of prime ideals. In this paper we study the prime ideal shortest vector problem (SVP) in the ring $ \Z[x]/(x^{2^n} + 1) $, a popular choice in the design of ideal lattice based cryptosystems. We show that a majority of rational primes lie under prime ideals admitting a polynomial time algorithm for SVP. Although the shortest vector problem of ideal lattices underpins the security of Ring-LWE cryptosystem, this work does not break Ring-LWE, since the security reduction is from the worst case ideal SVP to the average case Ring-LWE, and i…
We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.
A famous theorem of Szemerédi asserts that all subsets of the integers with positive upper density will contain arbitrarily long arithmetic progressions. There are many different proofs of this deep theorem, but they are all based on a fundamental dichotomy between structure and randomness, which in turn leads (roughly speaking) to a decomposition of any object into a structured (low-complexity) component and a random (discorrelated) component. Important examples of these types of decompositions include the Furstenberg structure theorem and the Szemerédi regularity lemma. One recent applicatio…
In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime $p$ less than $x$, the basic idea is to fix a constant $q\propto x^{1-\varepsilon}$, pick a uniformly random $a<q$ coprime to $q$, and choose $p$ of the form $a+t\cdot q$, where only $t$ is updated if the primality test fails. We prove that variants of this approach provide prime generation algorithms requiring few random bits and whose output distribution is close to uniform, under less and less expensive assumptions: first a relatively strong conjecture by H.…
The problem of determining cyclotomic numbers in terms of the solutions of certain Diophantine systems has been treated by many authors since the age of Gauss. In this paper we obtain an explicit expression for cyclotomic numbers of order 2l^2 in terms of the coefficients of the Jacobi sums of lower orders. At the end, we illustrate the nature of two matrices corresponding to two types of cyclotomic numbers.
We investigate the race between prime numbers in many residue classes modulo $q$, assuming the standard conjectures GRH and LI. Among our results we exhibit, for the first time, prime races modulo $q$ with $n$ competitor classes where the biases do not dissolve when $n, q\to \infty$. We also study the leaders in the prime number race, obtaining asymptotic formulae for logarithmic densities when the number of competitors can be as large as a power of $q$, whereas previous methods could only allow a power of $\log q$. The proofs use harmonic analysis related to the Hardy--Littlewood circle metho…
Corentin Perret-Gentil proved, under some very general conditions, that short sums of $\ell$-adic trace functions over finite fields of varying center converges in law to a Gaussian random variable or vector. The main inputs are P.~Deligne's equidistribution theorem, N.~Katz' works and the results surveyed in \cite{MR3338119}. In particular, this applies to $2$-dimensional Kloosterman sums $\mathsf{Kl}_{2,\mathbb{F}_q}$ studied by N.~Katz in \cite{MR955052} and in \cite{MR1081536} when the field $\mathbb{F}_q$ gets large. \par This article considers the case of short sums of normalized classic…
The distribution of partial sums of random multiplicative functions with a large prime factor
本文研究 Steinhaus 随机可乘函数在限制最大素因子大于 $\sqrt{x}$ 时的归一化部分和，证明其依分布收敛，并刻画极限分布为临界高斯可乘混沌积分平方根与独立标准复正态变量的乘积。
We investigate the distribution of the digits of quotients of randomly chosen positive integers taken from the interval $[1,T]$, improving the previously known error term for the counting function as $T\to+\infty$. We also resolve some natural variants of the problem concerning points with prime coordinates and points that are visible from the origin.
A central limit theorem for prime geodesics on random surfaces of large genus
该研究证明了大亏格Weil–Petersson随机闭双曲曲面上，范数在特定区间内的素测地线的归一化加权计数满足渐近高斯分布，拓展了素测地线计数的相关结论。
Random linear configurations in dense sets and primes
该研究证明了$[N]$的多对数稠密子集及素数的多对数相对稠密子集包含特定线性构型的结论，核心方法涉及定量广义冯·诺依曼定理等，拓展了数论中稠密集合与素数的构型研究。
Products of two elements of Granville's random model in residue classes
本文在Granville随机素数模型中无条件证明了Erdős-Odlyzko-Sárközy猜想关于模q既约剩余类包含两个素数乘积的类似版本，适用范围扩展到q^Θ（Θ>3/4），并指出模型选择的关键性。
We adopt an empirical approach to the characterization of the distribution of twin primes within the set of primes, rather than in the set of all natural numbers. The occurrences of twin primes in any finite sequence of primes are like fixed probability random events. As the sequence of primes grows, the probability decreases as the reciprocal of the count of primes to that point. The manner of the decrease is consistent with the Hardy--Littlewood Conjecture, the Prime Number Theorem, and the Twin Prime Conjecture. Furthermore, our probabilistic model, is simply parameterized. We discuss a sim…
It is shown that short-range correlations between large prime numbers (~10^5 and larger) have a Poissonian nature. Correlation length ζ= 4.5 for the primes ~10^5 and it is increasing logarithmically according to the prime number theorem. For moderate prime numbers (~10^4) the Poissonian distribution is not applicable while the correlation length surprisingly continues to follow to the logarithmical law. A chaotic (deterministic) hypothesis has been suggested to explain the moderate prime numbers apparent randomness.
We present an assessment of the distance in total variation of \textit{arbitrary} collection of prime factor multiplicities of a random number in $[n]=\{1,\dots, n\}$ and a collection of independent geometric random variables. More precisely, we impose mild conditions on the probability law of the random sample and the aforementioned collection of prime multiplicities, for which a fast decaying bound on the distance towards a tuple of geometric variables holds. Our results generalize and complement those from Kubilius et al. which consider the particular case of uniform samples in $[n]$ and co…
We consider the distribution of polygonal paths joining the partial sums of normalized Kloosterman sums modulo an increasingly high power p^n of a fixed odd prime p, a pure depth-aspect analogue of theorems of Kowalski-Sawin and Ricotta-Royer-Shparlinski. We find that this collection of Kloosterman paths naturally splits into finitely many disjoint ensembles, each of which converges in law as n->\infty to a distinct complex valued random continuous function. We further find that the random series resulting from gluing together these limits for every p converges in law as p->\infty, and that pa…
Limit theorems for random Dirichlet series with summation over primes, with an application to Rademacher random multiplicative functions
证明随机狄利克雷级数在s→0+时的泛函中心极限定理和重对数律，并应用于Rademacher随机乘性函数的对数。
On the analytic extension of Random Riemann Zeta Functions for some probabilistic models of the primes
本文研究随机黎曼Zeta函数的解析延拓，比较Cramér模型伪素数与具有局部对称性的伪素数两种情形，证明前者几乎必然可延拓至Re s>1/2但无法穿过临界线，后者可延拓至更大区域，并进一步探讨了Cramér伪素数相关的加法数论问题。
Are prime numbers and quadratic residues random?
本文提出一种基于单轨迹动力学熵的新分析方法，解决单个确定性序列的随机性/复杂性问题，证明二次剩余具高复杂性而质数复杂性意外低，为质数与二次剩余的随机性研究提供新视角。
For a number field K and a finite abelian group G, we determine the probabilities of various local completions of a random G-extension of K when extensions are ordered by conductor. In particular, for a fixed prime p of K, we determine the probability that p splits into r primes in a random G-extension of K that is unramified at p. We find that these probabilities are nicely behaved and mostly independent. This is in analogy to Chebotarev's density theorem, which gives the probability that in a fixed extension a random prime of K splits into r primes in the extension. We also give the asymptot…
These notes are based on my four lectures given at the Newton Institute in April 2004 during the Recent Perspectives in Random Matrix Theory and Number Theory Workshop. Their purpose is to introduce the reader to the analytic number theory necessary to understand Montgomery's work on the pair correlation of the zeros of the Riemann zeta-function and subsequent work on how this relates to prime numbers. A very brief introduction to Selberg's work on the moments of $S(T)$ is also given.
We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes, that would eventually appear in applications. Finally, our theory allows us to link with three different but important topics: the Hardy-Littlewood conjecture, the statistical mechanics of spin systems, and the celebrated Sierpinski fractal.
Let $G(X)$ denote the size of the largest gap between consecutive primes below $X$. Answering a question of Erdos, we show that $$G(X) \geq f(X) \frac{\log X \log \log X \log \log \log \log X}{(\log \log \log X)^2},$$ where $f(X)$ is a function tending to infinity with $X$. Our proof combines existing arguments with a random construction covering a set of primes by arithmetic progressions. As such, we rely on recent work on the existence and distribution of long arithmetic progressions consisting entirely of primes.
On Iwasawa $λ$-invariants for abelian number fields and random matrix heuristics
本文研究被 Dirichlet 特征扭曲的 $p$-进 zeta 函数的 $λ$-不变量分布，利用 $p$-进随机矩阵理论给出预测并提供数值证据，同时探讨了 $χ$-正则素数的比例。
Given a set $S=\{x^2+c_1,\dots,x^2+c_s\}$ defined over a field and an infinite sequence $γ$ of elements of $S$, one can associate an arboreal representation to $γ$, generalizing the case of iterating a single polynomial. We study the probability that a random sequence $γ$ produces a ``large-image'' representation, meaning that infinitely many subquotients in the natural filtration are maximal. We prove that this probability is positive for most sets $S$ defined over $\mathbb{Z}[t]$, and we conjecture a similar positive-probability result for suitable sets over $\mathbb{Q}$. As an application o…
On the number of binary quadratic forms having discriminant $1-4p$, $p$ prime
本文研究了具有判别式1-4p的二元二次型数量，并提出了一种随机欧拉乘积模型来解释Hurwitz类数的分布。
Norm forms, examples of which include $x^2 + y^2$, $x^2 + x y - 57 y^2$, and $x^3 + 2 y^3 + 4 z^3 - 6 x y z$, are integral forms arising from norms on number fields. We prove that the natural density of the set of integers represented by a norm form is zero, while the relative natural density of the set of prime numbers represented by a norm form exists and is positive. These results require tools from class field theory, including the Artin-Chebotarev density theorem and the Hilbert class field. We introduce these tools as we need them in the course of the main arguments. This article is expo…
Given an elliptic curve E over a finite field F_q of q elements, we say that an odd prime ell not dividing q is an Elkies prime for E if t_E^2 - 4q is a square modulo ell, where t_E = q+1 - #E(F_q) and #E(F_q) is the number of F_q-rational points on E; otherwise ell is called an Atkin prime. We show that there are asymptotically the same number of Atkin and Elkies primes ell < L on average over all curves E over F_q, provided that L >= (log q)^e for any fixed e > 0 and a sufficiently large q. We use this result to design and analyse a fast algorithm to generate random elliptic curves with #E(F…
In the framework of Cramer's probabilistic model of primes, we explore the exact and asymptotic distributions of maximal prime gaps. We show that the Gumbel extreme value distribution exp(-exp(-x)) is the limit law for maximal gaps between Cramer's random primes. The result can be derived from a general theorem about intervals between discrete random events occurring with slowly varying probability monotonically decreasing to zero. A straightforward generalization extends the Gumbel limit law to maximal gaps between prime constellations in Cramer's model.
A new generalized prime random approximation procedure and some of its applications
本文提出一种新的广义素数随机逼近方法，改进了现有离散化技术，并应用于解决多个开放问题，包括构造行为良好的广义数系和改进具有正则素数但极不规则整数的 Beurling 素数系统。
The aim of this article is to investigate how various Riemann Hypotheses would follow only from properties of the prime numbers. To this end, we consider two classes of $L$-functions, namely, non-principal Dirichlet and those based on cusp forms. The simplest example of the latter is based on the Ramanujan tau arithmetic function. For both classes we prove that if a particular trigonometric series involving sums of multiplicative characters over primes is $O(\sqrt{N})$, then the Euler product converges in the right half of the critical strip. When this result is combined with the functional eq…
We prove explicit versions of the Kronecker-Weyl theorems, both in a discrete and a continuous settings, without any linear independence hypothesis. As an application, we propose an alternative approach to problems concerning asymptotic densities in prime number races, over number fields and over function fields in one variable over finite fields, in the language of random variables. Our approach allows us to prove new results on the existence and positivity of some of those densities, which, in the case of races over function fields, do not require any linear independence hypothesis.
Logarithmic gaps have been used in order to find a periodic component of the sequence of prime numbers, hidden by a random noise (stochastic or chaotic). The recovered period for the sequence of the first 10000 prime numbers is equal to 8\pm1 (subject to the prime number theorem). For small and moderate values of the prime numbers (first 2000 prime numbers) this result has been directly checked using the twin prime killing method.
Biases in the distribution of primes in short intervals
在Hardy-Littlewood素数元组假设下，研究短区间内素数计数分布的二级渐近，发现算术修正导致比Cramér模型更强的向均值偏差，并通过有限筛论证和数值比较验证。
The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of this essential characteristic and present evidence for the conjecture that $π_k \sim |s_k|/ \log p_{k+1}^2$, where $π_k$ is the number of primes in $s_k$; or even stricter, that $y=x^{1/2}$ is both necessary and sufficient for the prime number theorem to be valid in intervals of length $y$. In addition, we propose and substantiate that the prime counting fun…
In [Huang-Raskind 2009], the authors proved that the discrete logarithm problem in a prime finite field is random polynomial time equivalent to computing the ramification signature of a real quadratic field. In this paper, we do this for a quadratic extension of a prime field.
In this article, we discuss the remarkable connection between two very different fields, number theory and nuclear physics. We describe the essential aspects of these fields, the quantities studied, and how insights in one have been fruitfully applied in the other. The exciting branch of modern mathematics, random matrix theory, provides the connection between the two fields. We assume no detailed knowledge of number theory, nuclear physics, or random matrix theory; all that is required is some familiarity with linear algebra and probability theory, as well as some results from complex analysi…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。