Explicit Kronecker-Weyl theorems and applications to prime number races

2020/07/11 by Alexandre Bailleul, Bailleul, Alexandre · 2 citations
Computer Science · Mathematics · #11K70 (Secondary) #11N05 (Primary) #11N64 #Analytic Number Theory Research #Coding theory and cryptography #FOS: Mathematics #Mathematical Approximation and Integration #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.2007.05763

openalex publication_date 2020/07/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Cited by

• Guarded Realization Semantics: Occurrence-Sensitive Certificates and Behavior-Dependent Lower Bounds
• On discrete X-ray transform

Related

• Orderings of weakly correlated random variables, and prime number races with many contestants
• Inclusive prime number races
• Prime number races with three or more competitors
• Prime Ideal Races With Several Competitors
• Prime number races for elliptic curves over function fields