MétaCan
Menu
Back to cohort
Record W1522679550 · doi:10.37236/5056

The CI Problem for Infinite Groups

2016· preprint· en· W1522679550 on OpenAlexaff
Joy Morris

Bibliographic record

VenueThe Electronic Journal of Combinatorics · 2016
Typepreprint
Languageen
FieldMathematics
TopicFinite Group Theory Research
Canadian institutionsUniversity of Lethbridge
Fundersnot available
KeywordsInfinite groupGroup (periodic table)MathematicsCombinatoricsFinite groupDiscrete mathematicsPhysics

Abstract

fetched live from OpenAlex

A finite group $G$ is a DCI-group if, whenever $S$ and $S'$ are subsets of $G$ with the Cayley graphs Cay$(G,S)$ and Cay$(G,S')$ isomorphic, there exists an automorphism $\varphi$ of $G$ with $\varphi(S)=S'$. It is a CI-group if this condition holds under the restricted assumption that $S=S^{-1}$. We extend these definitions to infinite groups, and make two closely-related definitions: an infinite group is a strongly (D)CI$_f$-group if the same condition holds under the restricted assumption that $S$ is finite; and an infinite group is a (D)CI$_f$-group if the same condition holds whenever $S$ is both finite and generates $G$.We prove that an infinite (D)CI-group must be a torsion group that is not locally-finite. We find infinite families of groups that are (D)CI$_f$-groups but not strongly (D)CI$_f$-groups, and that are strongly (D)CI$_f$-groups but not (D)CI-groups. We discuss which of these properties are inherited by subgroups. Finally, we completely characterise the locally-finite DCI-graphs on $\mathbb Z^n$. We suggest several open problems related to these ideas, including the question of whether or not any infinite (D)CI-group exists.

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.004
metaresearch head score (Gemma)0.022
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: none
Teacher disagreement score0.020
Threshold uncertainty score0.066

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.022
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0020.003
Science and technology studies0.0040.006
Scholarly communication0.0050.015
Open science0.0030.006
Research integrity0.0040.009
Insufficient payload (model declined to judge)0.0200.002

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.043
GPT teacher head0.336
Teacher spread0.293 · 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
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueThe Electronic Journal of CombinatoricsSame topicFinite Group Theory ResearchFrench-language works237,207