MétaCan
Menu
Back to cohort
Record W2949151702 · doi:10.48550/arxiv.1808.06328

Solvability of Equations by Quadratures and Newton's Theorem

2018· preprint· en· W2949151702 on OpenAlexaff
Askold Khovanskiĭ

Bibliographic record

VenuearXiv (Cornell University) · 2018
Typepreprint
Languageen
FieldComputer Science
TopicPolynomial and algebraic computation
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsMathematicsGalois groupDifferential Galois theoryValuation (finance)Pure mathematicsDifferential (mechanical device)Differential equationElementary functionApplied mathematicsGalois cohomologyAlgebra over a fieldMathematical analysis

Abstract

fetched live from OpenAlex

Picard--Vessiot theorem (1910) provides a necessary and sufficient condition for solvability of linear differential equations of order $n$ by quadratures in terms of its Galois group. It is based on the differential Galois theory and is rather involved. J.Liouville in 1839 found an elementary criterium for such solvability for $n=2$. J.F.Ritt simplified Liouville's theorem (1948). In 1973 M. Rosenlicht proved a similar criterium for arbitrary $n$. Rosenlicht work relies on the valuation theory and is not elementary. In these notes we show that the elementary Liouville--Ritt method based on developing solutions in Puiseux series as functions of a parameter works smoothly for arbitrary $n$ and proves the same criterium.

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.001
metaresearch head score (Gemma)0.005
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: none
Teacher disagreement score0.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0010.002
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.039
GPT teacher head0.186
Teacher spread0.147 · 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

Citations0
Published2018
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicPolynomial and algebraic computationFrench-language works237,207