MétaCan
Menu
Back to cohort
Record W1848938168 · doi:10.11575/cdm.v11i1.62390

Automorphisms of circulants that respect partitions

2012· article· en· W1848938168 on OpenAlexaff
Joy Morris

Bibliographic record

VenueOpen ULeth Scholarship (OPUS) (University of Lethbridge) · 2012
Typearticle
Languageen
FieldMathematics
TopicFinite Group Theory Research
Canadian institutionsUniversity of Lethbridge
Fundersnot available
KeywordsAutomorphismMathematicsCombinatoricsPartition (number theory)Vertex (graph theory)GraphCirculant matrixDiscrete mathematics

Abstract

fetched live from OpenAlex

In this paper, we begin by partitioning the edges (or arcs) of a circulant (di)graph according to which generator in the connection set leads to each edge. We then further refine the partition by subdividing any part that corresponds to an element of order less than n, according to which of the cycles generated by that element the edge is in. It is known that if the (di)graph is connected and has no multiple edges, then any automorphism that respects the first partition and fixes the vertex corresponding to the group identity must be an automorphism of the group (this is in fact true in the more general context of Cayley graphs). We show that automorphisms that respect the second partition and fix 0 must also respect the first partition, so are again precisely the group automorphisms of $\mathbb{Z}_n$.

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.005
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Insufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.363
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0050.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0000.002
Open science0.0020.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0020.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.304
GPT teacher head0.380
Teacher spread0.075 · 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 teacher head, not a consensus.

Study designObservational
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

Citations4
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueOpen ULeth Scholarship (OPUS) (University of Lethbridge)Same topicFinite Group Theory ResearchFrench-language works237,207