Mathematics – Number Theory
Scientific paper
2007-10-31
Mathematics
Number Theory
17 pages, latex, minor revisions
Scientific paper
Let E be a number field and G be a finite group. Let A be any O_E-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 O_L, the ring of algebraic integers of L, and A to be the associated order A of O_L in E[G]. The application of the algorithm to this special situation is implemented in Magma under certain extra hypotheses when K=E=Q.
Bley Werner
Johnston Henri
No associations
LandOfFree
Computing generators of free modules over orders in group algebras does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computing generators of free modules over orders in group algebras, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing generators of free modules over orders in group algebras will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-14683