Search arXivSearch

arXiv · 2608.02983

A Classification of Multiply Monogenic Quartic Orders

Abstract

We study two-times monogenic quartic orders; i.e., those of the shape $\mathbb{Z}[α] = \mathbb{Z}[β]$, with algebraic integers $α$ and $β$ not $\mathbb{Z}$-equivalent. Two specific types, describing possible algebraic relation among monogenizers of two-times monogenic orders were defined by Bérczes, Evetrse, Győry, who proved under certain conditions on the Galois group of the normal closure of a given number field $K$, that there can be only finitely many two-times monogenic $\mathbb{Z}$-orders in the ring of integers $K$ which are not of these specific two types. In this article, we prove this fact for all quartic number fields.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shabnam Akhtari, Jaxon Shumaker. 2026-08-04. A Classification of Multiply Monogenic Quartic Orders. https://arxiv.org/abs/2608.02983

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