Computing generators of free modules over orders in group algebras
Abstract
Let E be a number field and G be a finite group. Let A be any OE-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case that the Wedderburn decomposition of E[G] is explicitly computable and each component is in fact a matrix ring over a field, this leads to an algorithm that either gives an A-basis for X or determines that no such basis exists. Let L/K be a finite Galois extension of number fields with Galois group G such that E is a subfield of K and put d=[K:E]. The algorithm can be applied to certain Galois modules that arise naturally in this situation. For example, one can take X to be OL, the ring of algebraic integers of L, and A to be the associated order A of OL in E[G]. The application of the algorithm to this special situation is implemented in Magma under certain extra hypotheses when K=E=Q.
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.