MétaCan
Menu
Back to cohort
Record W2133220743 · doi:10.1112/blms/bdu033

Abelian surfaces over finite fields with prescribed groups

2014· preprint· en· W2133220743 on OpenAlexaff
Chantal David, Derek Garton, Zachary Scherr, Arul Shankar, Ethan Smith, Lola Thompson

Bibliographic record

VenueBulletin of the London Mathematical Society · 2014
Typepreprint
Languageen
FieldComputer Science
TopicCoding theory and cryptography
Canadian institutionsConcordia University
Fundersnot available
KeywordsAbelian groupCombinatoricsCongruence relationMathematicsPrime powerPrime (order theory)Order (exchange)Field (mathematics)Group (periodic table)Discrete mathematicsPhysicsPure mathematicsQuantum mechanics

Abstract

fetched live from OpenAlex

Let A be an abelian surface over F q , the field of q elements. The rational points on A / F q form an abelian group A ( F q ) ≃ Z / n 1 Z × Z / n 1 n 2 Z × Z / n 1 n 2 n 3 Z × Z / n 1 n 2 n 3 n 4 Z . We are interested in knowing which groups of this shape actually arise as the group of points on some abelian surface over some finite field. For a fixed prime power q, a characterization of the abelian groups that occur was recently found by Rybakov. One can use this characterization to obtain a set of congruences on certain combinations of coefficients of the corresponding Weil polynomials. We use Rybakov's criterion to show that groups Z / n 1 Z × Z / n 1 n 2 Z × Z / n 1 n 2 n 3 Z × Z / n 1 n 2 n 3 n 4 Z do not occur if n 1 is very large with respect to n 2 , n 3 , n 4 (Theorem 1.1), and occur with density zero in a wider range of the variables (Theorem 1.2).

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 categoriesnone
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.735
Threshold uncertainty score0.909

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0030.003
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.011
GPT teacher head0.215
Teacher spread0.204 · 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.

The models applied no category: nothing in the taxonomy fit this work.
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

Citations1
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueBulletin of the London Mathematical SocietySame topicCoding theory and cryptographyFrench-language works237,207