MétaCan
Menu
Back to cohort
Record W4408207844 · doi:10.1007/s00208-024-03084-4

Abelian varieties of prescribed order over finite fields

2025· article· lv· W4408207844 on OpenAlexafffund
Raymond van Bommel, Edgar Costa, Wanlin Li, Bjorn Poonen, Alexander Smith

Bibliographic record

VenueMathematische Annalen · 2025
Typearticle
Languagelv
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsUniversité de Montréal
FundersDivision of Mathematical SciencesFonds de recherche du Québec – Nature et technologiesNatural Sciences and Engineering Research Council of CanadaInstitut des Sciences Mathématiques, Université du Québec à MontréalCentre de Recherches MathématiquesSimons Foundation
KeywordsAlgorithmComputer science

Abstract

fetched live from OpenAlex

Abstract Given a prime power q and $$n \gg 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>≫</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> , we prove that every integer in a large subinterval of the Hasse–Weil interval $$[(\sqrt{q}-1)^{2n},(\sqrt{q}+1)^{2n}]$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>[</mml:mo> <mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:msqrt> <mml:mi>q</mml:mi> </mml:msqrt> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> <mml:mrow> <mml:mn>2</mml:mn> <mml:mi>n</mml:mi> </mml:mrow> </mml:msup> <mml:mo>,</mml:mo> <mml:msup> <mml:mrow> <mml:mo>(</mml:mo> <mml:msqrt> <mml:mi>q</mml:mi> </mml:msqrt> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> <mml:mrow> <mml:mn>2</mml:mn> <mml:mi>n</mml:mi> </mml:mrow> </mml:msup> <mml:mo>]</mml:mo> </mml:mrow> </mml:math> is $$\#A({\mathbb {F}}_q)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>#</mml:mo> <mml:mi>A</mml:mi> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>F</mml:mi> <mml:mi>q</mml:mi> </mml:msub> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> for some ordinary geometrically simple principally polarized abelian variety A of dimension n over $${\mathbb {F}}_q$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>F</mml:mi> <mml:mi>q</mml:mi> </mml:msub> </mml:math> . As a consequence, we generalize a result of Howe and Kedlaya for $${\mathbb {F}}_2$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>F</mml:mi> <mml:mn>2</mml:mn> </mml:msub> </mml:math> to show that for each prime power q , every sufficiently large positive integer is realizable, i.e., $$\#A({\mathbb {F}}_q)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>#</mml:mo> <mml:mi>A</mml:mi> <mml:mo>(</mml:mo> <mml:msub> <mml:mi>F</mml:mi> <mml:mi>q</mml:mi> </mml:msub> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> for some abelian variety A over $${\mathbb {F}}_q$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>F</mml:mi> <mml:mi>q</mml:mi> </mml:msub> </mml:math> . Our result also improves upon the best known constructions of sequences of simple abelian varieties with point counts towards the extremes of the Hasse–Weil interval. A separate argument determines, for fixed n , the largest subinterval of the Hasse–Weil interval consisting of realizable integers, asymptotically as $$q \rightarrow \infty $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>q</mml:mi> <mml:mo>→</mml:mo> <mml:mi>∞</mml:mi> </mml:mrow> </mml:math> ; this gives an asymptotically optimal improvement of a 1998 theorem of DiPippo and Howe. Our methods are effective: We prove that if $$q \le 5$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>q</mml:mi> <mml:mo>≤</mml:mo> <mml:mn>5</mml:mn> </mml:mrow> </mml:math> , then every positive integer is realizable, and for arbitrary q , every positive integer $$\ge q^{3 \sqrt{q} \log q}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>≥</mml:mo> <mml:msup> <mml:mi>q</mml:mi> <mml:mrow> <mml:mn>3</mml:mn> <mml:msqrt> <mml:mi>q</mml:mi> </mml:msqrt> <mml:mo>log</mml:mo> <mml:mi>q</mml:mi> </mml:mrow> </mml:msup> </mml:mrow> </mml:math> is realizable.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.913
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.017
GPT teacher head0.263
Teacher spread0.246 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes2
Has abstractyes

Explore more

Same venueMathematische AnnalenSame topicCoding theory and cryptographyFrench-language works237,207