MétaCan
Menu
Back to cohort
Record W2133379784 · doi:10.1090/s0002-9939-09-09857-8

On the irreducible representations of a finite semigroup

2009· article· en· W2133379784 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueProceedings of the American Mathematical Society · 2009
Typearticle
Languageen
FieldComputer Science
Topicsemigroups and automata theory
Canadian institutionsCarleton University
FundersNatural Sciences and Engineering Research Council of CanadaVetenskapsrådetSwedish Foundation for International Cooperation in Research and Higher Education
KeywordsMathematicsSemigroupIsomorphism (crystallography)Lemma (botany)Irreducible representationSimple (philosophy)Parameterized complexityPure mathematicsRing (chemistry)(g,K)-moduleAlgebra over a fieldCombinatorics

Abstract

fetched live from OpenAlex

Work of Clifford, Munn and Ponizovskiĭ parameterized the irreducible representations of a finite semigroup in terms of the irreducible representations of its maximal subgroups. Explicit constructions of the irreducible representations were later obtained independently by Rhodes and Zalcstein and by Lallement and Petrich. All of these approaches make use of Rees’s theorem characterizing $0$-simple semigroups up to isomorphism. Here we provide a short modern proof of the Clifford-Munn-Ponizovskiĭ result based on a lemma of J. A. Green, which allows us to circumvent the theory of $0$-simple semigroups. A novelty of this approach is that it works over any base ring.

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.

Full frame distilled prediction

Teacher imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation 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.045
Threshold uncertainty score0.262

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.014
GPT teacher head0.259
Teacher spread0.245 · 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