MétaCan
Menu
Back to cohort
Record W4416561731 · doi:10.1112/plms.70102

A quantum Frucht's theorem and quantum automorphisms of quantum Cayley graphs

2025· article· en· W4416561731 on OpenAlexaff
Michael Brannan, Daniel Gromada, Junichiro Matsuda, Adam Skalski, Mateusz Wasilewski

Bibliographic record

VenueProceedings of the London Mathematical Society · 2025
Typearticle
Languageen
FieldMathematics
TopicAdvanced Operator Algebra Research
Canadian institutionsUniversity of Waterloo
FundersJapan Society for the Promotion of ScienceNarodowe Centrum Nauki
KeywordsCayley graphAutomorphismQuantum algorithmQuantumQuantum graphQuantum operationQuantum no-deleting theoremQuantum group

Abstract

fetched live from OpenAlex

Abstract We establish a quantum version of Frucht's Theorem, proving that every finite quantum group is the quantum automorphism group of an undirected finite quantum graph. The construction is based on first considering several quantum Cayley graphs of the quantum group in question, and then providing a method to systematically combine them into a single quantum graph with the right symmetry properties. We also show that the dual of any non‐abelian finite group is ‘quantum rigid’. That is, always admits a quantum Cayley graph whose quantum automorphism group is exactly .

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.002
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.029
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.023
GPT teacher head0.309
Teacher spread0.285 · 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 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
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the London Mathematical SocietySame topicAdvanced Operator Algebra ResearchFrench-language works237,207