Search arXivSearch

arXiv · 2502.04120

Monogenic Even Cyclic Sextic Polynomials

Abstract

Suppose that $f(x)\in {\mathbb Z}[x]$ is monic and irreducible over ${\mathbb Q}$ of degree $N$. We say that $f(x)$ is monogenic if $\{1,θ,θ^2,\ldots ,θ^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(θ)$, where $f(θ)=0$, and we say $f(x)$ is cyclic if the Galois group of $f(x)$ over ${\mathbb Q}$ is isomorphic to the cyclic group of order $N$. In this note, we prove that there do not exist any monogenic even cyclic sextic binomials or trinomials. Although the complete story on monogenic even cyclic sextic quadrinomials remains somewhat of a mystery, we nevertheless determine that the union of three particular infinite sets of cyclic sextic quadrinomials contains exactly four quadrinomials that are monogenic with distinct splitting fields. We also show that the situation can be quite different for quadrinomials whose Galois group is not cyclic.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lenny Jones. 2025-02-07. Monogenic Even Cyclic Sextic Polynomials. https://arxiv.org/abs/2502.04120

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