Computing generators of free modules over orders in group algebras II

Details Computing generators of free modules over orders in group algebras II Computing generators of free modules over orders in group algebras II

2010-06-22

arxiv.org/abs/1006.4381v2

Mathematics

Number Theory

26 pages, latex, v2 includes many minor corrections and changes

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. In a previous article, we gave a necessary and sufficient condition for X to be free of given rank d over A. In the case that (i) the Wedderburn decomposition of E[G] is explicitly computable and (ii) each component is in fact a matrix ring over a field, this led to an algorithm that either gives elements that either gives an A-basis for X or determines that no such basis exists. In the present article, we generalise the algorithm by weakening condition (ii) considerably.

Affiliated with

Also associated with

No associations

Rating

Computing generators of free modules over orders in group algebras II 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 II, 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 II will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-276632