Bibliographic record
Abstract
An interchange ring, $(R,+,\bullet )$ , is an abelian group with a second binary operation defined so that the interchange law $(w+x)\bullet (y+z)=(w\bullet y)+(x\bullet z)$ holds. An interchange near ring is the same structure based on a group which may not be abelian. It is shown that each interchange (near) ring based on a group $G$ is formed from a pair of endomorphisms of $G$ whose images commute, and that all interchange (near) rings based on $G$ can be characterized in this manner. To obtain an associative interchange ring, the endomorphisms must be commuting idempotents in the endomorphism semigroup of $G$ . For $G$ a finite abelian group, we develop a group-theoretic analogue of the simultaneous diagonalization of idempotent linear operators and show that pairs of endomorphisms which yield associative interchange rings can be diagonalized and then put into a canonical form. A best possible upper bound of $4^{r}$ can be given for the number of distinct isomorphism classes of associative interchange rings based on a finite abelian group $A$ which is a direct sum of $r$ cyclic groups of prime power order. If $A$ is a direct sum of $r$ copies of the same cyclic group of prime power order, we show that there are exactly ${\textstyle \frac{1}{6}}(r+1)(r+2)(r+3)$ distinct isomorphism classes of associative interchange rings based on $A$ . Several examples are given and further comments are made about the general theory of interchange rings.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 teacher head, 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".