The system will be going down for regular maintenance. Please save your work and logout.
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]
< Reduce
Lithe and fast algorithmic number theory [LFANT]
Analyse cryptographique et arithmétique [CANARI]
Centre National de la Recherche Scientifique [CNRS]
Language
en
Document de travail - Pré-publication
English Abstract
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 ...Read more >
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).Read less <
English Keywords
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
Origin
Hal imported