MétaCan
Menu
Back to cohort
Record W1592738822 · doi:10.1090/s0002-9947-05-03954-1

Towers of 2-covers of hyperelliptic curves

2005· article· en· W1592738822 on OpenAlexafffund
Nils Bruin, E. V. Flynn

Bibliographic record

VenueTransactions of the American Mathematical Society · 2005
Typearticle
Languageen
FieldMathematics
TopicAlgebraic Geometry and Number Theory
Canadian institutionsSimon Fraser University
FundersDivision of Mathematical SciencesEngineering and Physical Sciences Research CouncilUniversity of British ColumbiaSimon Fraser UniversityPacific Institute for the Mathematical Sciences
KeywordsAlgorithmAnnotationHyperelliptic curveMathematicsType (biology)EmbeddingAbelian groupComputer scienceAlgebra over a fieldArtificial intelligencePure mathematics

Abstract

fetched live from OpenAlex

In this article, we give a way of constructing an unramified Galois-cover of a hyperelliptic curve. The geometric Galois-group is an elementary abelian 2 2 -group. The construction does not make use of the embedding of the curve in its Jacobian, and it readily displays all subcovers. We show that the cover we construct is isomorphic to the pullback along the multiplication-by- 2 2 map of an embedding of the curve in its Jacobian. We show that the constructed cover has an abundance of elliptic and hyperelliptic subcovers. This makes this cover especially suited for covering techniques employed for determining the rational points on curves. In particular the hyperelliptic subcovers give a chance for applying the method iteratively, thus creating towers of elementary abelian 2-covers of hyperelliptic curves. As an application, we determine the rational points on the genus 2 2 curve arising from the question of whether the sum of the first n n fourth powers can ever be a square. For this curve, a simple covering step fails, but a second step succeeds.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical
Teacher disagreement score0.012
Threshold uncertainty score0.041

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0010.003
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0120.001

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.020
GPT teacher head0.281
Teacher spread0.261 · 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 source (direct Gemma or distilled Codex), 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

Citations38
Published2005
Admission routes2
Has abstractyes

Explore more

Same venueTransactions of the American Mathematical SocietySame topicAlgebraic Geometry and Number TheoryFrench-language works237,207