On lattices over number fields (Q4375605)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1113832
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On lattices over number fields |
scientific article; zbMATH DE number 1113832 |
Statements
8 July 1999
0 references
relative bases
0 references
lattices over rings of algebraic integers
0 references
enumeration algorithm
0 references
LLL-algorithm
0 references
0 references
0.9427236
0 references
0.9390354
0 references
0 references
0.9267359
0 references
On lattices over number fields (English)
0 references
In order to find relative bases of number fields, it is necessary to construct a theory of lattices over rings of algebraic integers. Minimal bases do not always exist, and if so we require one ideal as an element of the so-called ``pseudobasis'' (not a free module in general). The ``Minkowskian'' bound is generalized to that of \textit{P. Humbert} [Théorie de la réduction des formes quadratiques définies positives dans un corps algébraique \(K\) fini, Comment. Math. Helvet. 12, 263-306 (1940; Zbl 0023.19905)]. An enumeration algorithm lists a (superfluous) basis based on this bound [see \textit{U. Fincke} and \textit{M. Pohst}, Math. Comput. 44, 463-471 (1985; Zbl 0556.10022)], and the LLL-algorithm reduces it to short vectors. For the entire collection see [Zbl 0852.00023].
0 references