MétaCan
Menu
Back to cohort
Record W4381570207 · doi:10.12697/acutm.2023.27.02

On dominions of certain ample monoids

2023· article· en· W4381570207 on OpenAlexfundno aff
Sohail Nasir, Abdullahi Umar

Bibliographic record

VenueActa et Commentationes Universitatis Tartuensis de Mathematica · 2023
Typearticle
Languageen
FieldComputer Science
Topicsemigroups and automata theory
Canadian institutionsnot available
FundersEesti TeadusfondiWilfrid Laurier University
KeywordsMathematicsSemigroupInverse semigroupUnary operationBijection, injection and surjectionPure mathematicsInverseMonoidDominionInverse elementCombinatoricsDiscrete mathematicsSpecial classes of semigroupsLawGeometry

Abstract

fetched live from OpenAlex

A semigroup S is called left ample if it can be embedded in the symmetric inverse semigroup IX of partial bijections of a non-empty set X such that the image of S is closed under the unary operation α → αα⁻¹, where α⁻¹ is the inverse of α in IX. Right ample semigroups are defined dually. A semigroup is called ample if it is both left and right ample. A monoid is (left, right) ample if it is (left, right) ample as a semigroup. We observe that the dominion of an ample subsemigroup of IX coincides with the inverse subsemigroup of IX generated by it. We then determine the dominions of certain submonoids of In, the symmetric inverse semigroup over a finite chain 1<2<⋯

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.001
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.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0010.002
Scholarly communication0.0020.002
Open science0.0000.002
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0030.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.021
GPT teacher head0.275
Teacher spread0.255 · 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

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueActa et Commentationes Universitatis Tartuensis de MathematicaSame topicsemigroups and automata theoryFrench-language works237,207