Theoretical background and an implementation of the p-group generation algorithm by Newman and O’Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant ...Theoretical background and an implementation of the p-group generation algorithm by Newman and O’Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite p-groups.展开更多
Theoretical foundations of a new algorithm for determining the p-capitulation type ù(K) of a number field K with p-class rank ?=2 are presented. Since ù(K) alone is insufficient for identifying the seco...Theoretical foundations of a new algorithm for determining the p-capitulation type ù(K) of a number field K with p-class rank ?=2 are presented. Since ù(K) alone is insufficient for identifying the second p-class group G=Gal(F<sub>p</sub><sup>2</sup>K∣K) of K, complementary techniques are deve- loped for finding the nilpotency class and coclass of . An implementation of the complete algorithm in the computational algebra system Magma is employed for calculating the Artin pattern AP(K)=(τ (K),ù(K)) of all 34631 real quadratic fields K=Q(√d) with discriminants 0d<10<sup>8</sup> and 3-class group of type (3, 3). The results admit extensive statistics of the second 3-class groups G=Gal(F<sub>3</sub><sup>2</sup>K∣K) and the 3-class field tower groups G=Gal(F<sub>3</sub><sup>∞</sup>K∣K).展开更多
Based on a general theory of descendant trees of finite p-groups and the virtual periodicity isomorphisms between the branches of a coclass subtree, the behavior of algebraic invariants of the tree vertices and their ...Based on a general theory of descendant trees of finite p-groups and the virtual periodicity isomorphisms between the branches of a coclass subtree, the behavior of algebraic invariants of the tree vertices and their automorphism groups under these isomorphisms is described with simple transformation laws. For the tree of finite 3-groups with elementary bicyclic commutator qu-otient, the information content of each coclass subtree with metabelian main-line is shown to be finite. As a striking novelty in this paper, evidence is provided of co-periodicity isomorphisms between coclass forests which reduce the information content of the entire metabelian skeleton and a significant part of non-metabelian vertices to a finite amount of data.展开更多
文摘Theoretical background and an implementation of the p-group generation algorithm by Newman and O’Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite p-groups.
文摘Theoretical foundations of a new algorithm for determining the p-capitulation type ù(K) of a number field K with p-class rank ?=2 are presented. Since ù(K) alone is insufficient for identifying the second p-class group G=Gal(F<sub>p</sub><sup>2</sup>K∣K) of K, complementary techniques are deve- loped for finding the nilpotency class and coclass of . An implementation of the complete algorithm in the computational algebra system Magma is employed for calculating the Artin pattern AP(K)=(τ (K),ù(K)) of all 34631 real quadratic fields K=Q(√d) with discriminants 0d<10<sup>8</sup> and 3-class group of type (3, 3). The results admit extensive statistics of the second 3-class groups G=Gal(F<sub>3</sub><sup>2</sup>K∣K) and the 3-class field tower groups G=Gal(F<sub>3</sub><sup>∞</sup>K∣K).
文摘Based on a general theory of descendant trees of finite p-groups and the virtual periodicity isomorphisms between the branches of a coclass subtree, the behavior of algebraic invariants of the tree vertices and their automorphism groups under these isomorphisms is described with simple transformation laws. For the tree of finite 3-groups with elementary bicyclic commutator qu-otient, the information content of each coclass subtree with metabelian main-line is shown to be finite. As a striking novelty in this paper, evidence is provided of co-periodicity isomorphisms between coclass forests which reduce the information content of the entire metabelian skeleton and a significant part of non-metabelian vertices to a finite amount of data.
