ISOMORPHISM OF RELATIVE HOLOMORPHS AND MATRIX SIMILARITY
Bibliographic record
Abstract
Abstract Let V be a finite dimensional vector space over the field with p elements, where p is a prime number. Given arbitrary $\alpha ,\beta \in \mathrm {GL}(V)$ , we consider the semidirect products $V\rtimes \langle \alpha \rangle $ and $V\rtimes \langle \beta \rangle $ , and show that if $V\rtimes \langle \alpha \rangle $ and $V\rtimes \langle \beta \rangle $ are isomorphic, then $\alpha $ must be similar to a power of $\beta $ that generates the same subgroup as $\beta $ ; that is, if H and K are cyclic subgroups of $\mathrm {GL}(V)$ such that $V\rtimes H\cong V\rtimes K$ , then H and K must be conjugate subgroups of $\mathrm {GL}(V)$ . If we remove the cyclic condition, there exist examples of nonisomorphic, let alone nonconjugate, subgroups H and K of $\mathrm {GL}(V)$ such that $V\rtimes H\cong V\rtimes K$ . Even if we require that noncyclic subgroups H and K of $\mathrm {GL}(V)$ be abelian, we may still have $V\rtimes H\cong V\rtimes K$ with H and K nonconjugate in $\mathrm {GL}(V)$ , but in this case, H and K must at least be isomorphic. If we replace V by a free module U over ${\mathbb {Z}}/p^m{\mathbb {Z}}$ of finite rank, with $m>1$ , it may happen that $U\rtimes H\cong U\rtimes K$ for nonconjugate cyclic subgroups of $\mathrm {GL}(U)$ . If we completely abandon our requirements on V, a sufficient criterion is given for a finite group G to admit nonconjugate cyclic subgroups H and K of $\mathrm {Aut}(G)$ such that $G\rtimes H\cong G\rtimes K$ . This criterion is satisfied by many 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 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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.011 | 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".