Auslander’s theorem for dihedral actions on preprojective algebras of type A
Bibliographic record
Abstract
Abstract Given an algebra R and G a finite group of automorphisms of R, there is a natural map $\eta _{R,G}:R\#G \to \mathrm {End}_{R^G} R$ , called the Auslander map. A theorem of Auslander shows that $\eta _{R,G}$ is an isomorphism when $R=\mathbb {C}[V]$ and G is a finite group acting linearly and without reflections on the finite-dimensional vector space V. The work of Mori–Ueyama and Bao–He–Zhang has encouraged the study of this theorem in the context of Artin–Schelter regular algebras. We initiate a study of Auslander’s result in the setting of nonconnected graded Calabi–Yau algebras. When R is a preprojective algebra of type A and G is a finite subgroup of $D_n$ acting on R by automorphism, our main result shows that $\eta _{R,G}$ is an isomorphism if and only if G does not contain all of the reflections through a vertex.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".