2006
DOI: 10.1515/crelle.2006.093
|View full text |Cite
|
Sign up to set email alerts
|

Classes réalisables d'extensions non abéliennes

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
39
0
6

Year Published

2008
2008
2014
2014

Publication Types

Select...
6

Relationship

3
3

Authors

Journals

citations
Cited by 19 publications
(46 citation statements)
references
References 19 publications
1
39
0
6
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: Introductionsupporting
confidence: 63%
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: Introductionsupporting
confidence: 63%
“…We reformulate this result in a more concrete form, allowing easier comparison with [1] and [4], at the end of this paper (see Theorem 7.3.1).…”
Section: It Is Immediate From Theorem 1 Thatmentioning
confidence: 99%
See 3 more Smart Citations