A COVERING PROBLEM FOR PLANE LATTICES

被引：0
|
作者：
VASSALLO, S [1 ]
机构：
[1] UNIV CATTOLICA SACRO CUORE,IST MATEMAT GEN FINANZIARIA & ECON,I-20123 MILAN,ITALY
来源：
GEOMETRIAE DEDICATA | 1992年 / 43卷 / 03期
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let L be a plane lattice and {v1, v2} a Minkowski reduced base of L. In this note we prove that if a convex body K has minimal width w(K) greater-than-or-equal-to \v2\ sin phi + \v1\(square-root 3/2), where phi is the acute angle between v1 and v2, then K is a covering set for L.
引用
收藏
页码：321 / 335
页数：15
相关论文
共 50 条
  • [1] Covering sets for plane lattices
    Vassallo, S
    Wills, JM
    [J]. MONATSHEFTE FUR MATHEMATIK, 1996, 121 (04): : 381 - 389
  • [2] Hardness of the Covering Radius Problem on Lattices
    Haviv, Ishay
    Regev, Oded
    [J]. CCC 2006: TWENTY-FIRST ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2006, : 145 - 158
  • [3] The complexity of the covering radius problem on lattices and codes
    Guruswami, V
    Micciancio, D
    Regev, O
    [J]. 19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 161 - 173
  • [4] A MINIMAL DENSITY PLANE COVERING PROBLEM
    EGGLESTON, HG
    [J]. MATHEMATIKA, 1965, 12 (24P2) : 226 - +
  • [5] Using GIS and K=3 Central Place Lattices for Efficient Solutions to the Location Set-Covering Problem in a Bounded Plane
    Straitiff, Stephanie L.
    Cromley, Robert G.
    [J]. TRANSACTIONS IN GIS, 2010, 14 (03) : 331 - 349
  • [6] ON THE COVERING MULTIPLICITY OF LATTICES
    CONWAY, JH
    SLOANE, NJA
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1992, 8 (02) : 109 - 130
  • [7] COVERING IN FREE LATTICES
    DEAN, RA
    [J]. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1961, 67 (06) : 548 - &
  • [8] THE MAXIMAL COVERING LOCATION PROBLEM WITH FACILITY PLACEMENT ON THE ENTIRE PLANE
    MEHREZ, A
    STULMAN, A
    [J]. JOURNAL OF REGIONAL SCIENCE, 1982, 22 (03) : 361 - 365
  • [9] Covering aspects of the Niemeier lattices
    Alahmadi, Adel
    Deza, Michel
    Sikiric, Mathieu Dutour
    Sole, Patrick
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2019, 80 : 102 - 106
  • [10] CUTTING-PLANE ALGORITHM FOR QUADRATIC SET-COVERING PROBLEM
    BAZARAA, MS
    GOODE, JJ
    [J]. OPERATIONS RESEARCH, 1975, 23 (01) : 150 - 158
12345