On the T-ramified, S-split p-class field towers over an extension of degree prime to p
نویسندگان
چکیده
منابع مشابه
Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...
متن کاملOn the ring of p-integers of a cyclic p-extension over a number field
Let p be a prime number. A finite Galois extension N/F of a number field F with group G has a normal p-integral basis (p-NIB for short) when O′ N is free of rank one over the group ring O′ F [G]. Here, O′ F = OF [1/p] is the ring of p-integers of F . Let m = p be a power of p and N/F a cyclic extension of degree m. When ζm ∈ F×, we give a necessary and sufficient condition for N/F to have a p-N...
متن کاملP-class Groups of Certain Extensions of Degree P
Let p be an odd prime number. In this article we study the distribution of p-class groups of cyclic number fields of degree p, and of cyclic extensions of degree p of an imaginary quadratic field whose class number is coprime to p. We formulate a heuristic principle predicting the distribution of the p-class groups as Galois modules, which is analogous to the Cohen-Lenstra heuristics concerning...
متن کاملd-VFCSR or vectorial FCSR constructed on totally ramified extension of the p-adic numbers
In this paper, we introduce a vectorial conception of dFCSRs to build these registers over any finite field. We describe the structure of d-vectorial FCSRs and we develop an analysis to obtain basic properties like periodicity and the existence of maximal length sequences. To illustrate these vectorial d-FCSRs, we present simple examples and we compare with those of Goresky, Klapper and Xu.
متن کاملH Ead - T Ail V Ideo S Treaming over P Eer to P Eer Systems
P2P systems similar to file sharing applications are being used vastly due to unrestricted nature of these systems. Their unrestricting comes from their ability to cooperate and aggregate peer’s resources and their scalability. On the other side, today technologies are traditional client-server applications. These applications can perform strongly but they are not scalable due to limitations on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2009
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2009.02.008