Search arXivSearch

arXiv · math/0005037

Finite Groups Embeddable in Division Rings

Abstract

Finite groups that are embeddable in the multiplicative groups of division rings $K$ were completely determined by S. A. Amitsur in 1955. In case $K$ has characteristic $p>0$, the only possible finite subgroups of $K^*$ are cyclic groups, according to a theorem of I. N. Herstein. Thus, the only interesting case is when $K$ has characteristic 0; that is, when $K\supseteq {\Bbb Q}$. Herstein conjectured that odd-order subgroups of division rings $K$ were cyclic, and he proved this to be the case when $K$ is the division ring of the real quaternions. Herstein's conjecture was settled negatively by Amitsur. As part of his complete classification of finite groups in division rings, Amitsur showed that the smallest noncyclic odd-order group that can be embedded in a division ring is one of order 63 (and this group is unique). Amitsur's paper is daunting to read as it is long and technically complicated. In lecturing to a graduate class on division rings, I tried to find a simple reason for the ``first exceptional odd order'' 63 (to Herstein's conjecture). After some work, I did come up with a reason that was simple enough to be explained to my class, without having to go through any part of Amitsur's paper. Furthermore, the method I used led easily to the second exceptional odd order, 117 (which was not mentioned in Amitsur's paper). Since this line of reasoning did not seem to have appeared in the literature before, I record it in this short note. To better motivate the results discussed here, I have also included a quick exposition on the beginning part of the theory of finite subgroups of division rings.

Explore related subjects

Keep this discovery

BibTeXRIS

Tsit-Yuen Lam. 2000-05-03. Finite Groups Embeddable in Division Rings. https://arxiv.org/abs/math/0005037

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA