Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2112.06688

Quaternion algebras and square power classes over biquadratic extensions

Frank Chemotti·Jan Minac·Tung T. Nguyen·Andrew Schultz·John Swallow·Nguyen Duy Tan
View original source ↗Read source document ↗Export metadata ↓

Abstract

Recently the Galois module structure of square power classes of a field $K$ has been computed under the action of $\text{Gal}(K/F)$ in the case where $\text{Gal}(K/F)$ is the Klein $4$-group. Despite the fact that the modular representation theory over this group ring includes an infinite number of non-isomorphic indecomposable types, the decomposition for square power classes includes at most $9$ distinct summand types. In this paper we determine the multiplicity of each summand type in terms of a particular subspace of $\text{Br}(F)$, and show that all "unexceptional" summand types are possible.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Frank Chemotti, Jan Minac, Tung T. Nguyen, Andrew Schultz, John Swallow, Nguyen Duy Tan. 2023-04-26. Quaternion algebras and square power classes over biquadratic extensions. https://arxiv.org/abs/2112.06688

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗