On the extreme points in a cubic order (Q2501405)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the extreme points in a cubic order |
scientific article; zbMATH DE number 5051880
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the extreme points in a cubic order |
scientific article; zbMATH DE number 5051880 |
Statements
On the extreme points in a cubic order (English)
0 references
6 September 2006
0 references
The Voronoi algorithm can be used to obtain a fundamental system of units of a cubic field. This is a periodic algorithm which involves an isotropic vector of a quadratic form for which one wants to exhibit an extremal point adjacent to 1. B. Adam proved that there are eight potential candidates for this extremal point. In the paper under review, this list of eight candidates is reduced to five. Moreover, the Voronoi algorithm is used to obtain a fundamental unit for a class of cubic fields \(Q(\omega)\) considered by C. Levesque and G. Rhin, namely when \(f(\omega)=0\) with \(f(X)=X^3-n^mX^e-(n-1)X-n^m\).
0 references
Voronoi algorithm
0 references
cubic fields
0 references
fundamental unit
0 references
0.7996280789375305
0 references
0.7903637290000916
0 references
0.7850837111473083
0 references