The Lie algebra of the lowest transitively differential group of degree three <sup>*</sup>
Bibliographic record
Abstract
Abstract We investigate the real Lie algebra of first-order differential operators with polynomial coefficients, which is subject to the following requirements. (1) The Lie algebra should admit a basis of differential operators with homogeneous polynomial coefficients of degree up to and including three. (2) The generator of the algebra must include the translation operators <?CDATA $\partial_k$?> ∂ k for all the variables <?CDATA $x_1,\ldots,x_k$?> x 1 , … , x k . (3) The Lie algebra is the smallest indecomposable Lie algebra satisfying (1) and (2). It turns out to be a 39-dimensional Lie algebra in six variables (k = 6) and the construction of this algebra is also the simplest possible case in the general construction of the Lie algebras of the transitively differential groups introduced by Guillemin and Sternberg in 1964 involving the coefficients of degree 3. Those algebras and various subalgebras have similarities with algebras related to different applications in physics such as the Schrödinger, Conformal and Galilei algebras with and without central extension. The paper is devoted to the presentation of the structure and different decompositions of the Lie algebra under investigation. It is also devoted to the presentation of relevant Lie subalgebras and the construction of their Casimir invariants using different methods. We rely, in particular, on differential operator realizations, symbolic computation packages, the Berezin bracket and virtual copies of the Lie algebras.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.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.
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".