Search arXiv⌕ Search

arXiv · 2609.16360

Number fields as curves over $\mathbf{F}_1$

Abstract

We study function fields in one variable over the field with one element $\mathbf{F}_1$. It is proved that the Galois extensions of $\mathbf{Q}$ are isomorphic to the curves over $\mathbf{F}_1$ being understood as the Deitmar schemes. Specifically, one gets explicit formulas linking the genus and the number of cusps of an algebraic curve over the extension $\mathbf{F}_{1^m}$ of order $m\ge 1$ of the field $\mathbf{F}_1$ and the $m$-th roots of unity of the corresponding number field. It follows that elliptic curves with one cusp over $\mathbf{F}_1$ are either the cyclotomic fields or the maximal abelian unramified extensions of the quadratic number fields. Our proof depends on representaion of the Drinfeld modules by the bounded linear operators on a Hilbert space and the crossed product structure of the Cuntz-Krieger algebras.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Igor V. Nikolaev. 2026-09-14. Number fields as curves over $\mathbf{F}_1$. https://arxiv.org/abs/2609.16360

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

KEEP EXPLORING

Related papers

Generalized modular equations and the CM values of Hauptmoduln

Monstrous moonshine relates the representation of the Monster finite sporadic simple group to the distinguished modular functions, called Hauptmoduln. Chen-Yui~\cite{Chen-Yui} showed that the CM values of Hauptmoduln which appeare in monstrous moonshine (but not all) are algebraic integers, which is similar to the singular moduli of the $j$-function. In this paper, we generalize this result to Hauptmoduln whose $q$-coefficients are cyclotomic integers. A main idea for our proof is the use of generalized modular equations for Hauptmoduln, which was introduced by Cummins-Gannon~\cite{Cummins-Gannon} in the study of monstrous moonshine. As an application, we show that if a formal $q$-series satisfies the special combinatoric property called complete replicability, its CM values are algebraic integers, without assuming the modular invariance.

math.NT↗

On Graphical Partitions with Restricted Parts

An integer partition of $n$ is called graphical if its parts form a degree sequence of a simple graph. While unrestricted graphical partitions have been extensively studied, much less is known when the parts are restricted to a prescribed set. In this work, we investigate the probability that a uniformly random partition of an even integer $n$, subject to such restrictions, is graphical. We establish an upper bound on this probability expressed solely in terms of the Durfee square of the partition. Additionally, we evaluate the most-probable size of the Durfee square, depending solely on $n$ and the restrictions on the parts. Thus, we establish typical bounds on the probability that such random partitions are graphical. Our approach employs the Nash-Williams graphical condition, the saddle-point method and Edgeworth expansions.

math.NT↗