Hierarchies of the Korteweg–de Vries Equation Related to Complex Expansion and Perturbation
Bibliographic record
Abstract
We consider the possibility of constructing a hierarchy of the complex extension of the Korteweg–de Vries equation (cKdV), which under the assumption that the function is real passes into the KdV hierarchy. A hierarchy is understood here as a family of nonlinear partial differential equations with a Lax pair with a common scattering operator. The cKdV hierarchy is obtained by examining the equation on the eigenvalues of the fourth-order Hermitian self-conjugate operator on the invariant transformations of the eigenvector-functions. It is proved that for an operator H^n to transform a solution of the equation on eigenvalues M^−λEV=0 into a solution of the same equation, it is necessary and sufficient that the complex function ux,t of the operator M^ satisfies special conditions that are the complexifications of the KdV hierarchy equations. The operators H^n are constructed as differential operators of order 2n + 1. We also construct a hierarchy of perturbed KdV equations (pKdV) with a special perturbation function, the dynamics of which is described by a linear equation. It is based on the system of operator equations obtained by Bogoyavlensky. Since the elements of the hierarchies are united by a common scattering operator, it remains unchanged in the derivation of the equations. The second differential operator of the Lax pair has increasing odd derivatives while retaining a skew-symmetric form. It is shown that when perturbation tends to zero, all hierarchy equations are converted to higher KdV equations. It is proved that the pKdV hierarchy equations are a necessary and sufficient condition for the solutions of the equation on eigenvalues to have invariant transformations.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".