2004
DOI: 10.1023/b:kthe.0000028979.91416.00
|View full text |Cite
|
Sign up to set email alerts
|

Generators and Relations for O

Abstract: Tate's algorithm for computing K 2 O F for rings of integers in a number field has been adapted for the computer and gives explicit generators for the group and sharp bounds on their order-the latter, together with some structural results on the p-primary part of K 2 O F due to Tate and Keune, gives a proof of its structure for many number fields of small discriminants, confirming earlier conjectural results. For the first time, tame kernels of non-Galois fields are obtained.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
80
0

Year Published

2004
2004
2014
2014

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 21 publications
(80 citation statements)
references
References 35 publications
0
80
0
Order By: Relevance
“…These equations are expected to be given a proof. Using the computing programm in [1], we compute that all the K-groups are confirmed with the conjectural order and give their structures.…”
Section: Lichtenbaum Conjecture On Non-galois Fieldsmentioning
confidence: 99%
See 3 more Smart Citations
“…These equations are expected to be given a proof. Using the computing programm in [1], we compute that all the K-groups are confirmed with the conjectural order and give their structures.…”
Section: Lichtenbaum Conjecture On Non-galois Fieldsmentioning
confidence: 99%
“…Using method in [1], we have K 2 (O F ) is isomorphic to Z/2 × Z/2. Moreover, we get the equation as follows by the numerical method…”
Section: Lichtenbaum Conjecture On Non-galois Fieldsmentioning
confidence: 99%
See 2 more Smart Citations
“…Note that p/p is ramified if and only if p 2 ∩ Z = (pZ) in Step (2b). If p/p is unramified, then we can take π = p in Step (4); otherwise, at least one of the γ i does not belong to p 2 , and this is easy to test since the HNF for p 2 is known. The reduction modulo p in the last step ensures that a small element is returned, and the test π ∈ p 2 is only needed when e(p/p) = 1.…”
mentioning
confidence: 99%