Search arXivSearch

arXiv · 2509.00667

On Triple Quadratic Residue Symbols in Real Quadratic Fields

Abstract

We introduce triple quadratic residue symbols $[\mathfrak{p}_1, \mathfrak{p}_2, \mathfrak{p}_3]$ for certain finite primes $\mathfrak{p}_i$'s of a real quadratic field $k$ with trivial narrow class group. For this, we determine a presentation of the Galois group of the maximal pro-2 Galois extension over $k$ unramified outside $\mathfrak{p}_1, \mathfrak{p}_2, \mathfrak{p}_3$ and infinite primes, from which we derive mod 2 arithmetic triple Milnor invariants $μ_2(123)$ yielding the triple symbol $[\mathfrak{p}_1, \mathfrak{p}_2, \mathfrak{p}_3] = (-1)^{μ_2(123)}$. Our symbols $[\mathfrak{p}_1, \mathfrak{p}_2, \mathfrak{p}_3]$ describes the decomposition law of $\mathfrak{p}_3$ in a certain dihedral extension $K$ over $k$ of degree 8, determined by $\mathfrak{p}_1, \mathfrak{p}_2$. The field $K$ and our symbols $[\mathfrak{p}_1, \mathfrak{p}_2, \mathfrak{p}_3]$ are generalizations over real quadratic fields of Rédei's dihedral extension of $\mathbb{Q}$ and Rédei's triple symbol of rational primes. We give examples of Rédei type extensions $K$ over real quadratic fields. We also give a cohomological interpretation of our symbols in terms of Massey products.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Atsuki Kuramoto. 2026-06-11. On Triple Quadratic Residue Symbols in Real Quadratic Fields. https://doi.org/10.1007/s40687-025-00593-9

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