An algorithm for testing Leopoldt's conjecture

DOI10.1016/0022-314X(87)90054-0MaRDI QIDQ1091426zbMATH OpenWikidataFDO

Authors Jonathan W. Sands, Johannes Buchmann

Publication date 1987

Published in Journal of Number Theory (Search for Journal in Brave)

zbMATH Keywords

unitsalgorithmLeopoldt conjecturep-adic logarithmp-adic regulator

Mathematics Subject Classification ID

Other number fields (11R21) Units and factorization (11R27) Algebraic number theory computations (11Y40)

Cites work

• scientific article; zbMATH DE number 3918492 (Why is no real title available?)
• scientific article; zbMATH DE number 3749126 (Why is no real title available?)
• scientific article; zbMATH DE number 3760283 (Why is no real title available?)
• scientific article; zbMATH DE number 3279238 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3394272 (Why is no real title available?)
• $\Gamma $-extensions et invariants cyclotomiques
• Formulations de la conjecture de Leopoldt et étude d'une condition suffisante
• Indépendance linéaire sur \=Q de logarithmes p-adiques de nombres algébriques et rang p-adique du groupe des unités d'un corps de nombres
• Kummer's and Iwasawa's Version of Leopoldt's Conjecture
• Leopoldt's conjecture and Reiner's theorem
• On Effective Computation of Fundamental Units. I
• On the units of algebraic number fields
• On the units of an algebraic number field
• The class number of pure fields of prime degree

Cited in

(4)

• \({\mathbb{Z}{}}_ p\)-independent systems of units
• An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
• On the \(p\)-adic Stark conjecture at \(s=1\) and applications
• A sufficient condition for Leopoldt's conjecture

This page was built for publication: An algorithm for testing Leopoldt's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1091426)