期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Artin Transfer Patterns on Descendant Trees of Finite p-Groups 被引量:3
1
作者 Daniel C. Mayer 《Advances in Pure Mathematics》 2016年第2期66-104,共39页
Based on a thorough theory of the Artin transfer homomorphism from a group G to the abelianization of a subgroup of finite index , and its connection with the permutation representation and the monomial representation... Based on a thorough theory of the Artin transfer homomorphism from a group G to the abelianization of a subgroup of finite index , and its connection with the permutation representation and the monomial representation of G, the Artin pattern , which consists of families , resp. , of transfer targets, resp. transfer kernels, is defined for the vertices of any descendant tree T of finite p-groups. It is endowed with partial order relations and , which are compatible with the parent-descendant relation of the edges of the tree  T. The partial order enables termination criteria for the p-group generation algorithm which can be used for searching and identifying a finite p-group G, whose Artin pattern is known completely or at least partially, by constructing the descendant tree with the abelianization of G as its root. An appendix summarizes details concerning induced homomorphisms between quotient groups, which play a crucial role in establishing the natural partial order on Artin patterns and explaining the stabilization, resp. polarization, of their components in descendant trees T of finite p-groups. 展开更多
关键词 Artin Transfer Kernel Type Target Type Descendant Tree coclass Tree coclass graph
在线阅读 下载PDF
Periodic Bifurcations in Descendant Trees of Finite <i>p</i>-Groups 被引量:2
2
作者 Daniel C. Mayer 《Advances in Pure Mathematics》 2015年第4期162-195,共34页
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. 展开更多
关键词 FINITE p-Group Central Series DESCENDANT TREE Pro-p GROUP coclass TREE p-Covering GROUP Nuclear Rank Multifurcation coclass graph Parametrized Presentation Commutator Calculus Schur -GROUP
在线阅读 下载PDF
Index-<i>p</i>Abelianization Data of <i>p</i>-Class Tower Groups
3
作者 Daniel C. Mayer 《Advances in Pure Mathematics》 2015年第5期286-313,共28页
Given a fixed prime number p, the multiplet of abelian type invariants of the p-class groups of all unramified cyclic degree p extensions of a number field K is called its IPAD (index-p abeliani- zation data). These i... Given a fixed prime number p, the multiplet of abelian type invariants of the p-class groups of all unramified cyclic degree p extensions of a number field K is called its IPAD (index-p abeliani- zation data). These invariants have proved to be a valuable information for determining the Galois group of the second Hilbert p-class field and the p-capitulation type of K. For p=3 and a number field K with elementary p-class group of rank two, all possible IPADs are given in the complete form of several infinite sequences. Iterated IPADs of second order are used to identify the group of the maximal unramified pro-p extension of K. 展开更多
关键词 p-Class GROUPS p-Principalization Types p-Class Field Towers Quadratic Fields Second p-Class GROUPS p-Class TOWER GROUPS coclass graphs
在线阅读 下载PDF
Criteria for Three-Stage Towers of <i>p</i>-Class Fields
4
作者 Daniel C. Mayer 《Advances in Pure Mathematics》 2017年第2期135-179,共45页
Let p be a prime and K be a number field with non-trivial p-class group ClpK. A crucial step in identifying the Galois group G∞p of the maximal unramified pro-p extension of K is to determine its two-stage approximat... Let p be a prime and K be a number field with non-trivial p-class group ClpK. A crucial step in identifying the Galois group G∞p of the maximal unramified pro-p extension of K is to determine its two-stage approximation M=G2pk, that is the second derived quotient M&simeq;G/Gn. The family τ1K of abelian type invariants of the p-class groups ClpL of all unramified cyclic extensions L/K of degree p is called the index- abelianization data (IPAD) of K. It is able to specify a finite batch of contestants for the second p-class group M of K. In this paper we introduce two different kinds of generalized IPADs for obtaining more sophisticated results. The multi-layered IPAD (τ1Kτ(2)K) includes data on unramified abelian extensions L/K of degree p2 and enables sharper bounds for the order of M in the case Clpk&simeq;(p,p,p), where current im-plementations of the p-group generation algorithm fail to produce explicit contestants for M , due to memory limitations. The iterated IPAD of second order τ(2)K contains information on non-abelian unramified extensions L/K of degree p2, or even p3, and admits the identification of the p-class tower group G for various infinite series of quadratic fields K=Q(√d) with ClpK&simeq;(p,p) possessing a p-class field tower of exact length lpK=3 as a striking novelty. 展开更多
关键词 Hilbert p-Class FIELD TOWER p-Class GROUP p-Principalization Types Quadratic Fields Unramified Cyclic Cubic FIELD Extensions p-Class TOWER GROUP Relation Rank Metabelianization coclass graphs
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部