2011
DOI: 10.1090/s0025-5718-2011-02488-9
|View full text |Cite
|
Sign up to set email alerts
|

Computing generators of free modules over orders in group algebras II

Abstract: Abstract. Let E be a number field and G a finite group. Let A be any O E -order of full rank in the group algebra E [G] and X 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 E[G] ∼ = χ M χ is explicitly computable and (ii) each M χ is in fact a matrix ring over a field, this led to an algorithm that either gives elements α 1 , . . . , α d ∈ X such that X = Aα 1 ⊕ · · · ⊕ Aα d or d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
5

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…Heuristically, one obtains the best results (in the naive meaning that we get small algebraic numbers with small denominators) if we use an integral normal basis element α 0 . Such an element can be computed by the algorithms developed in [3] and [4]. Henceforth, we assume the rationality conjecture and set…”
Section: Theorem 45 We Assume (I)-(viii) Then the Following Are Eqmentioning
confidence: 99%
“…Heuristically, one obtains the best results (in the naive meaning that we get small algebraic numbers with small denominators) if we use an integral normal basis element α 0 . Such an element can be computed by the algorithms developed in [3] and [4]. Henceforth, we assume the rationality conjecture and set…”
Section: Theorem 45 We Assume (I)-(viii) Then the Following Are Eqmentioning
confidence: 99%
“…Let K/Q be an S 4 -extension with full decomposition group that is wildly ramified. Here we describe how to use the Magma implementation of [5, Algorithm 3.1 (6)] to check whether or not O K is locally free at 2 over A K/Q , or equivalently, whether O K P is free over A K P /Q 2 , where P is the unique prime of K above 2. We used the database [30] to find six number fields, each of which has a completion at 2 equal to one of the six wildly ramified S 4 -extensions of Q 2 listed in the database of p-adic fields [24].…”
Section: Induction For Orders Of a Certain Structurementioning
confidence: 99%
“…In particular, [BE05] applies in the case that A is commutative and semisimple; [BW09] applies to group rings , where G is a finite group, but only decides whether two lattices are both locally free and stably isomorphic; and [DD08, KV10, Pag14] apply to maximal or Eichler orders in quaternion algebras. The series of articles [Ble97, BJ08, BJ11, HJ20] consider progressively more general situations, culminating in a solution to when A is semisimple, but they all involve a very expensive enumeration step, which in many cases renders the algorithm impractical. We refer the reader to the introduction of [HJ20] for a more detailed overview.…”
Section: Introductionmentioning
confidence: 99%