2008
DOI: 10.1016/j.jnt.2007.02.009
|View full text |Cite
|
Sign up to set email alerts
|

On realizable Galois module classes and Steinitz classes of nonabelian extensions

Abstract: Let k be a number field and O k its ring of integers. Let Γ be a finite group, N/k a Galois extension with Galois group isomorphic to Γ , and O N the ring of integers of N . Let M be a maximal O k -order in the semisimple algebra k[Γ ] containing O k [Γ ], and Cl(M) its locally free class group. When N/k is tame (i.e., at most tamely ramified), extension of scalars allows us to assign to O N the class of. We define the set R(M) of realizable classes to be the set of classes c ∈ Cl(M) such that there exists a G… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
32
0
3

Year Published

2010
2010
2014
2014

Publication Types

Select...
6

Relationship

3
3

Authors

Journals

citations
Cited by 12 publications
(35 citation statements)
references
References 27 publications
0
32
0
3
Order By: Relevance
“…An analogous result to that of [4] for the corresponding metabelian groups of order p r (p r − 1) (where p is an odd TOME 63 (2013), FASCICULE 1 prime) was given in [1] under the hypothesis ξ p ∈ k. In both [1] and [4] we drew on the language of coding theory: the construction of Γ-extensions can be conveniently described in terms of a certain cyclic code of length p r − 1 (for p = 2 and p > 2 respectively) over the field F p . Our goal in this paper is to improve on the results in [1] and [4] in two directions, treating the cases p = 2 and p > 2 simultaneously. We again assume that ξ p ∈ k. The first improvement is that we will work over the group ring O k [Γ] rather than over a maximal order M, so that we obtain a description of R(O k [Γ]) itself and not just of its image R(M).…”
Section: Introductionmentioning
confidence: 69%
See 4 more Smart Citations
“…An analogous result to that of [4] for the corresponding metabelian groups of order p r (p r − 1) (where p is an odd TOME 63 (2013), FASCICULE 1 prime) was given in [1] under the hypothesis ξ p ∈ k. In both [1] and [4] we drew on the language of coding theory: the construction of Γ-extensions can be conveniently described in terms of a certain cyclic code of length p r − 1 (for p = 2 and p > 2 respectively) over the field F p . Our goal in this paper is to improve on the results in [1] and [4] in two directions, treating the cases p = 2 and p > 2 simultaneously. We again assume that ξ p ∈ k. The first improvement is that we will work over the group ring O k [Γ] rather than over a maximal order M, so that we obtain a description of R(O k [Γ]) itself and not just of its image R(M).…”
Section: Introductionmentioning
confidence: 69%
“…In the excluded case m = 1, the assertions of Theorems 2 and 3 and the first equality of Theorem 1 are trivially true and the second equality of Theorem 1 reduces to McCulloh's result (1).…”
Section: It Is Immediate From Theorem 1 Thatmentioning
confidence: 87%
See 3 more Smart Citations