On the central exponent of superalgebras with superinvolution
Bibliographic record
Abstract
Abstract The growth of central polynomials for matrix algebras over a field of characteristic zero was first studied by Regev in 2016 $2016$ 2016 . This problem can be generalized by analyzing the behavior of the dimension c Subscript n Superscript z Baseline left parenthesis upper A right parenthesis $c_n^z(A)$ c n z ( A ) of the space of multilinear polynomials of degree n modulo the central polynomials of an algebra A . In 2018 $2018$ 2018 , Giambruno and Zaicev established the existence of the limit limit Underscript n right arrow infinity Endscripts RootIndex n StartRoot c Subscript n Superscript z Baseline left parenthesis upper A right parenthesis EndRoot period $\lim \limits _{n \to \infty }\sqrt [n]{c_n^{z}(A)}.$ lim n → ∞ c n z ( A ) n . In this article, we extend this framework to superalgebras equipped with a superinvolution, proving both the existence and the finiteness of the corresponding limit.
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.003 | 0.014 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.004 | 0.001 |
| Science and technology studies | 0.002 | 0.004 |
| Scholarly communication | 0.004 | 0.006 |
| Open science | 0.002 | 0.004 |
| Research integrity | 0.001 | 0.004 |
| Insufficient payload (model declined to judge) | 0.015 | 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".