An algorithm for computing Schur indices of characters
Abstract
We describe an algorithm for computing Schur indices of irreducible characters of a finite group G, based on computations within G and its subgroups and with their character tables. The algorithm has been implemented within \ and examples of its use are given. We also compare the output of the algorithm on groups associated with sporadic simple groups with the results of W. Feit. The differences are considered.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.