MétaCan
Menu
Back to cohort
Record W4406548308 · doi:10.48550/arxiv.2501.09313

Invariant Reduction for Partial Differential Equations. II: The General Framework

2025· preprint· en· W4406548308 on OpenAlexfundno aff
Kostya Druzhkov, Alexei F. Cheviakov

Bibliographic record

VenueArXiv.org · 2025
Typepreprint
Languageen
FieldMathematics
TopicNumerical methods for differential equations
Canadian institutionsnot available
FundersDivision of Mathematical SciencesNatural Sciences and Engineering Research Council of Canada
KeywordsInvariant (physics)Partial differential equationMathematicsReduction (mathematics)Mechanism (biology)Applied mathematicsPure mathematicsMathematical analysisPhysicsMathematical physicsGeometryQuantum mechanics

Abstract

fetched live from OpenAlex

For a system of partial differential equations (PDEs) $F = 0$ admitting a local (point, contact, or higher) symmetry $X$ with the characteristic $φ$, invariant solutions satisfy the reduced system $F = φ= 0$. We propose a framework that allows, for every $X$-invariant conservation law, presymplectic structure, variational principle, or another geometric structure of the given PDE system $F = 0$, to systematically calculate its corresponding reduced form that describes the corresponding structure for the reduced system $F = φ= 0$. In particular, we show in what way Noether's theorem holding for the given PDE system is inherited by the reduced PDE system. We consider several detailed examples, including cases of point and higher symmetry invariance. The proposed framework is directly applicable to a wide range of PDE models, including complex PDE systems of contemporary interest arising across disciplines, where symmetry reduction is essential for analysis and simulation, as well as to integrable, Lagrangian, and gauge systems.

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.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: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0020.002
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0040.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.182
GPT teacher head0.409
Teacher spread0.228 · 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
GenreMethods

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 routes1
Has abstractyes

Explore more

Same venueArXiv.orgSame topicNumerical methods for differential equationsFrench-language works237,207