Cyclic cubic number fields with harmonically balanced capitulation
ALLOMBERT, Bill
Lithe and fast algorithmic number theory [LFANT]
Analyse cryptographique et arithmétique [CANARI]
Centre National de la Recherche Scientifique [CNRS]
Lithe and fast algorithmic number theory [LFANT]
Analyse cryptographique et arithmétique [CANARI]
Centre National de la Recherche Scientifique [CNRS]
ALLOMBERT, Bill
Lithe and fast algorithmic number theory [LFANT]
Analyse cryptographique et arithmétique [CANARI]
Centre National de la Recherche Scientifique [CNRS]
< Réduire
Lithe and fast algorithmic number theory [LFANT]
Analyse cryptographique et arithmétique [CANARI]
Centre National de la Recherche Scientifique [CNRS]
Langue
en
Document de travail - Pré-publication
Résumé en anglais
It is proved that c = 689347 = 31*37*601 is the smallest conductor of a cyclic cubic number field K whose maximal unramified pro-3-extension E = F(3,infinity,K) possesses an automorphism group G = Gal(E/K) of order 6561 ...Lire la suite >
It is proved that c = 689347 = 31*37*601 is the smallest conductor of a cyclic cubic number field K whose maximal unramified pro-3-extension E = F(3,infinity,K) possesses an automorphism group G = Gal(E/K) of order 6561 with coinciding relation and generator rank d2(G) = d1(G) = 3 and harmonically balanced transfer kernels kappa(G) in S(13).< Réduire
Mots clés en anglais
Finite 3-groups
elementary tricyclic commutator quotient
relation rank
closed groups
Schur groups
Andozhskii-Tsvetkov groups
maximal and second maximal subgroups
kernels of Artin transfers
abelian quotient invariants
rank distribution
p-group generation algorithm
descendant tree
cyclic cubic number fields
harmonically balanced capitulation
Galois groups
3-class field tower
Origine
Importé de halUnités de recherche