An algorithm for testing Leopoldt's conjecture |
| |
| Institution: | Mathematisches Institut, Universität Düsseldorf, 4000 Düsseldorf, West Germany;Department of Mathematics and Statistics, University of Vermont, Burlington, Vermont 05405 USA |
| |
| Abstract: | Based on an elementary version of Leopoldt's conjecture due to Iwasawa and Sands we develop an algorithm for testing this conjecture in an arbitrary algebraic number field for any prime p. Using this algorithm we are able to prove Leopoldt's conjecture for several pure fields of degree 5 and 7. We also discuss relations with class numbers. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
