Skip to content
Preprint

A conditional arithmetic obstruction to the prime numbers as a spectrum of a probability measure

Aug 2026 · 0 citations · 15 references
Mathematics

Abstract

Let $\Pp=\{2,3,5,7,\ldots\}$ denote the set of prime numbers. We prove that if every sufficiently large positive even integer can be represented as a difference of two primes, then there is no Borel probability measure $\mu$ on $\R$ for which \(\left\{e^{2\pi i p x}:p\in\Pp\right\}\) is an orthonormal basis of $L^2(\mu)$. In particular, under the Polignac conjecture, the prime numbers $\Pp$ cannot be a spectrum (i.e., the set of frequencies of an exponential orthonormal basis) of any probability measure on $\R$.

View source

Similar papers

Preprint Sep 2026

Primes are Complete for a Class of $N$-Bernoulli Convolutions Spectral Pair

We study the complete number problem for a class of self-similar spectral measures on the real line. For a spectral pair $(\mu,\Lambda)$, a real number $t$ is called complete if $t\Lambda$ is also a spectrum of $\mu$. In this paper we consider the $N$-Bernoulli convolution $\mu_{N^r,\mathcal D},\mathcal D=\{0,1,\ldots,...

Zi-Chao Chi, Jian-Feng Lu, He-Xiang Wang · 0 citations
Preprint Oct 2026

Pythagorean pairs in boxes of prime powers

Let $p_i$ be the $i$th prime, and let $f(N)$ be the largest cardinality of a subset of \[ \left\{\prod_{i=1}^N p_i^{a_i}:0\le a_i<N,\ a_i\in\mathbb{Z}\right\} \] containing no two distinct legs of an integer right triangle. We prove \[ f(N) \ll N^N (\log\log N)^{-1/1296}. \]

Rong-Zhong Xiao · 1 citation
Preprint Sep 2026

Asymptotic counting of integers with prime factors $p_{r^a s^b}$

Let $p_n$ be the $n$th prime, and let $r,s\ge2$ be fixed multiplicatively independent integers. We count the integers up to $x$ whose prime factors all have the form $p_{r^a s^b}$ with integers $a,b\ge0$. Our asymptotic formula for this count has relative error $o(1)$ and is explicit down to the multiplicative constant...

M. Golafshan · 0 citations
Preprint Sep 2026

Distinct exponents in the prime factorization

Following Erd\H{o}s (1982) and Sanna (2019), we study the arithmetic function $h(n)$, which is defined to be the number of distinct exponents in the prime factorization of a positive integer $n$. Among other things, we show that $$ \sum_{n\leq x}h(\phi(n)) \asymp x\left(\frac{\log\log x}{\log\log\log x}\right)^{1/2}, $...

Mikhail R. Gabdullin, V. V. Iudelevich · 0 citations
Preprint Sep 2026

On a Tur\'an's theorem for small primes

Denote by $\omega(n)$ the number of distinct prime divisors of the natural number $n$. In 2007, Granville and Soundararajan gave a quite new method to compute the higher moments $\sum_{n\leq x}(\omega(n)-\log\log x)^{k}$, for a wide range of integers $k\geq 2$. In this notes, we shall apply the method for $\omega_{z}(n...

T. Minamide, Haruka Sakai, Y. Tanigawa · 1 citation
Preprint Sep 2026

Non-existence of sets with few special directions

Let $p$ be an odd prime and let $S\subseteq\mathbb{F}_p^2$ have cardinality divisible by $p$. We prove that, for all sufficiently large primes $p$, no such set has exactly four special directions, and obtain a conditional extension to larger numbers of special directions under an affine-independence assumption on the c...

Luca Ghidelli, Gergely Kiss, Gábor Somlai · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.