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

From MaRDI portal
Created claim: Wikidata QID (P12): Q56959241, #quickstatements; #temporary_batch_1707161894653
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Johan T. Håstad / rank
Normal rank
 
Property / author
 
Property / author: Johan T. Håstad / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lovász' lattice reduction and the nearest lattice point problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5785796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank

Latest revision as of 17:38, 18 June 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