Search arXivSearch

arXiv · 2501.05056

Rudin Inequality, Chang Theorem, primes and squares

Abstract

We prove that the set of large values of the trigonometric polynomial over a subset of density of the primes has some additive structure, similarly to what happens for subsets of densities in $\mathbb{Z}/{N}\mathbb{Z}$ but in a weaker form. To do so, we prove large sieve inequalities for \emph{dissociate sets} $\mathcal{X}$ of circle points and functions $f$ whose support~$S$ is finite and respectively in an interval, in the set of primes or in the set of squares. Set $T(f,x)=\sum_{n}f(n)\exp(2iπnx)$. These inequalities are of the shape $\sum_{x\in\mathcal{X}}|T(f,x)|^2\ll |S|\|f\|_2^2\log(8R/|S|)$ where $R$ is respectively $N$, $N/\log N$ and $\sqrt{N}$. The implied constants depend on the spacement between sumsets of~$\mathcal{X}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Olivier Ramaré. 2025-01-09. Rudin Inequality, Chang Theorem, primes and squares. https://arxiv.org/abs/2501.05056

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT