MétaCan
Menu
Back to cohort
Record W7115727736 · doi:10.5281/zenodo.17951257

NON-ABELIAN AFFINE GROUPS WITH SCALAR LINEAR PART ACTING ON R^n

2025· preprint· en· W7115727736 on OpenAlexaff

Bibliographic record

VenueZenodo (CERN European Organization for Nuclear Research) · 2025
Typepreprint
Languageen
FieldComputer Science
TopicCellular Automata and Applications
Canadian institutionsUniversité de Moncton
Fundersnot available
KeywordsAffine transformationAbelian groupMultiplicative functionScalar (mathematics)Affine groupMultiplicative groupOrbit (dynamics)General linear groupClosure (psychology)

Abstract

fetched live from OpenAlex

In this paper, we explore the action of a non-Abelian group G on R^n , where G consists of affine transformations with linear parts being scalar multiples of the identity matrix. We provide a complete criterion for when G admits a dense orbit, thus characterizing its hypercyclic behavior. Additionally, we present an explicit and unified description of the closure of any orbit under the group action. Specifically, we express the closure of an orbit passing through any point \( x \in \mathbb{R}^n \) as:G(x) = \overline{\Lambda} \cdot T_x(\overline{K})$, where \Lambda is a multiplicative subgroup of R^-{0} , and K is an additive subgroup invariant under \Lambda . This form reveals a structure that partially mirrors the symmetry seen in Abelian group actions. The results offer a framework that can be extended to a broader class of non-Abelian affine groups.

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 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.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Science and technology studies, Scholarly communication, Insufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.918
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0020.000
Scholarly communication0.0010.000
Open science0.0030.006
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0010.004

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.031
GPT teacher head0.252
Teacher spread0.222 · 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; both teacher heads agree on what is shown here.

Study designNot applicable
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
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueZenodo (CERN European Organization for Nuclear Research)Same topicCellular Automata and ApplicationsFrench-language works237,207