MétaCan
Menu
Back to cohort
Record W2021618367 · doi:10.1017/s0013091505000404

STRONGLY CLEAN POWER SERIES RINGS

2007· article· en· W2021618367 on OpenAlexafffund
Jianlong Chen, Yiqiang Zhou

Bibliographic record

VenueProceedings of the Edinburgh Mathematical Society · 2007
Typearticle
Languageen
FieldMathematics
TopicRings, Modules, and Algebras
Canadian institutionsMemorial University of Newfoundland
FundersMinistry of Education, IndiaNatural Sciences and Engineering Research Council of CanadaMemorial University of NewfoundlandNational Natural Science Foundation of China
KeywordsRing (chemistry)IdempotenceCommutative ringUnit (ring theory)EndomorphismVon Neumann regular ringCombinatoricsMathematicsPiMatrix ringPower seriesStereochemistryCommutative propertyCrystallographyChemistryDiscrete mathematicsPure mathematicsGeometryMathematical analysisInvertible matrix

Abstract

fetched live from OpenAlex

Abstract An element $a$ in a ring $R$ with identity is called strongly clean if it is the sum of an idempotent and a unit that commute. And $a\in R$ is called strongly $\pi$-regular if both chains $aR\supseteq a^2R\supseteq\cdots$ and $Ra\supseteq Ra^2\supseteq\cdots$ terminate. A ring $R$ is called strongly clean (respectively, strongly $\pi$-regular) if every element of $R$ is strongly clean (respectively, strongly $\pi$-regular). Strongly $\pi$-regular elements of a ring are all strongly clean. Let $\sigma$ be an endomorphism of $R$. It is proved that for $\varSigma r_ix^i\in R[[x,\sigma]]$, if $r_0$ or $1-r_0$ is strongly $\pi$-regular in $R$, then $\varSigma r_ix^i$ is strongly clean in $R[[x,\sigma]]$. In particular, if $R$ is strongly $\pi$-regular, then $R[[x,\sigma]]$ is strongly clean. It is also proved that if $R$ is a strongly $\pi$-regular ring, then $R[x,\sigma]/(x^n)$ is strongly clean for all $n\ge1$ and that the group ring of a locally finite group over a strongly regular or commutative strongly $\pi$-regular ring is strongly clean.

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 imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.010
Threshold uncertainty score0.034

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.002
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0020.004
Open science0.0000.003
Research integrity0.0000.002
Insufficient payload (model declined to judge)0.0100.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.

Opus teacher head0.022
GPT teacher head0.269
Teacher spread0.247 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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".

Quick stats

Citations25
Published2007
Admission routes2
Has abstractyes

Explore more

Same venueProceedings of the Edinburgh Mathematical SocietySame topicRings, Modules, and AlgebrasFrench-language works237,207