Let F be a quadratic extension of Q and O F the ring of integers in F. A result of Tate enables one to compute the 2-rank of K 2 O F in terms of the 2-rank of the class group. Formulas for the 4-rank of K 2 O F exist, but are more involved. We give upper and lower bounds on the 8-rank of K 2 O F in
A diophantine definition of integers in the rings of rational numbers
โ Scribed by Alexandra Shlapentokh
- Publisher
- John Wiley and Sons
- Year
- 1991
- Tongue
- English
- Weight
- 568 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0010-3640
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
The author considers rings of rational numbers which are integral at all the primes except, possibly, primes contained in a finite set. In such rings a Diophantine definition of โค is constructed to show that all the recursively enumerable subsets of the ring are Diophantine.
๐ SIMILAR VOLUMES
Let \(K\) be an imaginary quadratic field in which 2 splits. If \(\hat{i}\) is an integral ideal, let \(K(i)\) denote the ray class field with ray \(i\). Ph. Cassou-Noguรจs and M. J. Taylor (J. London Math. Soc. (2), 37, 1988, p. 65. Theorem 2) show that \(K(j)\) is monogenic over \(K(1)\), the Hilbe
## Abstract The shortest definition of a number by a first order formula with one free variable, where the notion of a formula defining a number extends a notion used by Boolos in a proof of the Incompleteness Theorem, is shown to be non computable. This is followed by an examination of the complex
Central and local limit theorems are derived for the number of distinct summands in integer partitions, with or without repetitions, under a general scheme essentially due to Meinardus. The local limit theorems are of the form of Crame rtype large deviations and are proved by Mellin transform and th
fields, the problem is essentially a planar lattice point problem (cf. ZAGIER [17]). To this, the deep results of HUXLEY [3], [4] can be applied to get For cubic fields, W. MULLER [12] proved that ## 43 - (h the class number), using a deep exponential sum technique due to KOLESNIK [7]. every n