Dual vectors and lower bounds for the nearest lattice point problem (Q1107568): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:13, 5 March 2024

scientific article
Language Label Description Also known as
English
Dual vectors and lower bounds for the nearest lattice point problem
scientific article

    Statements

    Dual vectors and lower bounds for the nearest lattice point problem (English)
    0 references
    1988
    0 references
    Let \(L\) be a lattice in \(\mathbb R^ n\) and let \(L^*\) be its dual. The author shows that for each \(x\in\mathbb R^ n\setminus L\) there exists a nonzero \(v\in L^*\) such that \[ \frac{| \{(x,v)\}|}{\| v\|}\geq c_ n\cdot d(x,L), \] where \((x,v)\) is the usual inner product on \(\mathbb R^ n,\) \(\{\alpha\}\) the minimal distance of \(\alpha\) to an integer, \(d(x,L)\) is the distance from \(x\) to \(L\) and \(c_ n\geq (6n^ 2+1)^{-1}.\) The proof is not constructible. The best known constructible proof gives a value \(c_ n\geq 9^{-n}.\)
    0 references
    dual lattice
    0 references
    lattice basis
    0 references
    lattice
    0 references
    homogeneous minimum
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references