MétaCan
Menu
Back to cohort
Record W4399803900 · doi:10.4204/eptcs.403.7

Power Quotients of Plactic-like Monoids

2024· article· en· W4399803900 on OpenAlexafffund
Antoine Abram, Florent Hivert, James D. Mitchell, Jean-Christophe Novelli, Maria Tsalakou

Bibliographic record

VenueElectronic Proceedings in Theoretical Computer Science · 2024
Typearticle
Languageen
FieldComputer Science
Topicsemigroups and automata theory
Canadian institutionsUniversité du Québec à Montréal
FundersNatural Sciences and Engineering Research Council of CanadaAgence Nationale de la Recherche
KeywordsMonoidQuotientCongruence relationSyntactic monoidMathematicsFree monoidPure mathematicsSet (abstract data type)Generator (circuit theory)Power (physics)CombinatoricsAlgebra over a fieldComputer sciencePhysics

Abstract

fetched live from OpenAlex

In this paper we describe the quotients of several plactic-like monoids by the least congruences containing the relations $a^{\sigma(a)} = a$ with $\sigma(a)\ge 2$ for every generator $a$. The starting point for this description is the recent paper of Abram and Reutenauer about the so-called stylic monoid which happens to be the quotient of the plactic monoid by the relations $a^2 = a$ for every letter $a$. The plactic-like monoids considered are the plactic monoid itself, the Chinese monoid, and the sylvester monoid. In each case we describe: a set of normal forms, and the idempotents; and obtain formulae for their size.

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.003
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.006
Threshold uncertainty score0.022

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.000
Science and technology studies0.0010.002
Scholarly communication0.0020.004
Open science0.0000.002
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0060.001

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.003
GPT teacher head0.227
Teacher spread0.223 · 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
Published2024
Admission routes2
Has abstractyes

Explore more

Same venueElectronic Proceedings in Theoretical Computer ScienceSame topicsemigroups and automata theoryFrench-language works237,207