Bibliographic record
Abstract
Abstract We consider a Weitzenböck derivation Δ acting on a polynomial ring R = K [ ξ 1 , ξ 2 , ... , ξ m ] $ R=K[\xi _1,\xi _2,\ldots ,\xi _m] $ over a field K of characteristic 0. The K-algebra R Δ = { h ∈ R ∣ Δ ( h ) = 0 } ${R^\Delta = \lbrace h \in R \mid \Delta (h) = 0\rbrace }$ is called the algebra of constants. Nowicki considered the case where the Jordan matrix for Δ acting on R 1, the degree 1 component of R, has only Jordan blocks of size 2. He conjectured that a certain set generates R Δ $R^{\Delta }$ in that case. Recently Khoury, Drensky and Makar-Limanov and Kuroda have given proofs of Nowicki's conjecture. Here we consider the case where the Jordan matrix for Δ acting on R 1 has only Jordan blocks of size at most 3. We use combinatorial methods to give a minimal set of generators 𝒢 for the algebra of constants R Δ $R^{\Delta }$ . Moreover, we show how our proof yields an algorithm to express any h ∈ R Δ $h \in R^\Delta $ as a polynomial in the elements of 𝒢. In particular, our solution shows how the classical techniques of polarization and restitution may be used to augment the techniques of SAGBI bases to construct generating sets for subalgebras.
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.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.006 | 0.002 |
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".