Search arXivSearch

arXiv · 2603.07641

Oscillatory Interference in Dirichlet L-Functions and the Separation of Primes

Abstract

Dirichlet's theorem guarantees infinitely many primes in each reduced residue class modulo q, but the analytic mechanism underlying this separation is often difficult to visualize directly. In this article we construct simplified oscillatory reconstructions based on the imaginary parts of the nontrivial zeros of Dirichlet L-functions. These reconstructions produce interference patterns that act as analytic filters separating primes according to congruence classes. Examples for moduli 3, 4, and 5 illustrate how the oscillatory frequencies associated with the zeros generate structured peak patterns at prime powers. For complex characters modulo 5, conjugate pairs of L-functions produce cancellation effects that mirror algebraic relations between characters. When all characters modulo 5 are combined, the Dedekind factorization of the cyclotomic field $\mathbf{Q}(ζ_5)$ appears visually as a striking interference pattern in which only primes congruent to 1 (mod 5) remain. These numerical experiments provide a visual bridge between analytic number theory and algebraic number theory by illustrating how the zero distributions of L-functions generate structured oscillations in prime-related functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jouni J. Takalo. 2026-03-08. Oscillatory Interference in Dirichlet L-Functions and the Separation of Primes. https://arxiv.org/abs/2603.07641

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