Search arXivSearch

arXiv · 2005.10188

A Density of Ramified Primes

Abstract

Let $K$ be a cyclic totally real number field of odd degree over $\mathbb{Q}$ with odd class number, such that every totally positive unit is the square of a unit, and such that $2$ is inert in $K/\mathbb{Q}$. We define a family of number fields $\{K(p)\}_p$, depending on $K$ and indexed by the rational primes $p$ that split completely in $K/\mathbb{Q}$, such that $p$ is always ramified in $K(p)$ of degree $2$. Conditional on a standard conjecture on short character sums, the density of such rational primes $p$ that exhibit one of two possible ramified factorizations in $K(p)/\mathbb{Q}$ is strictly between $0$ and $1$ and is given explicitly as a formula in terms of $[K:\mathbb{Q}]$. Our results are unconditional in the cubic case. Our proof relies on a detailed study of the joint distribution of spins of prime ideals.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stephanie Chan, Christine McMeekin, Djordjo Milovic. 2020-11-03. A Density of Ramified Primes. https://doi.org/10.1007/s40993-021-00295-5

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