Search arXivSearch

arXiv · 2609.19546

A new family of maximal curves not covered by the Hermitian curve

Abstract

For every prime power $q>2$ and every even integer $n\ge4$, we construct an $\mathbb{F}_{q^{2n}}$-maximal curve of genus $(q^2-1)q^n/2$ that is not covered by the Hermitian curve over $\mathbb{F}_{q^{2n}}$. The defining equation also gives a Kummer model for the Beelen--Montanucci curves when $n\ge3$ is odd. We compute the genus for both odd and even $n$ and give a uniform proof of maximality by counting rational places. For $q>2$ and odd $n\ge5$, we also prove that the Beelen--Montanucci curves are not covered by the Hermitian curve, extending the known result for Galois coverings. For every prime power $q$ and $n\ge4$, we also give an explicit automorphism subgroup of order $(q^n+1)q(q^2-1)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Liming Ma, Yipeng Wang. 2026-09-17. A new family of maximal curves not covered by the Hermitian curve. https://arxiv.org/abs/2609.19546

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