Search arXivSearch

arXiv · 1807.00892

On the Asymptotics of a Prime Spin Relation

Abstract

For cyclic totally real number fields $K$ with odd prime degree $n$, odd class number, $2$ inert, and the property that every totally positive unit is a square, the density of rational primes $p$ that satisfy the spin relation spin$(\mathfrak{p},σ)$spin$(\mathfrak{p},σ^{-1})=1$ for all $σ\neq 1 \in$ Gal$(K/\mathbb{Q})$ where $\mathfrak{p}$ is a prime of $K$ above $p$ is given by the formula \[ D_K=\frac{m_Kn+1}{n2^n} \] where $m_K$ is a computable and bounded invariant of the number field $K$. This formula is modified in the erratum from the original version due to an error in the inert case. As the inert case is insubstantial, the strength of the results is not significantly changed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christine McMeekin. 2021-01-05. On the Asymptotics of a Prime Spin Relation. https://doi.org/10.1016/j.jnt.2018.11.027

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