A problem of Steinhaus: Can all placements of a planar set contain exactly one lattice point?

被引：0
|
作者：
Kolountzakis, MN
机构：
来源：
ANALYTIC NUMBER THEORY, VOL. 2 - PROCEEDINGS OF A CONFERENCE IN HONOR OF HEINI HALBERSTAM | 1996年 / 139卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Steinhaus asked whether there exists a subset of the plane which, no matter how translated and rotated, always contains exactly one point with integer coordinates. The best result on this problem so far has been that of Beck who showed, using harmonic analysis, that no such bounded measurable set exists. By simplifying Beck's method and by pushing it to its limits we improve his result. We show that if a set is measurable and there exists a direction such that the set is very small outside large strips parallel to the direction, then the set cannot have the property of Steinhaus.
引用
收藏
页码：559 / 565
页数：7
相关论文
共 26 条
  • [11] Some inequalities for planar convex sets containing one lattice point
    Hernandez, MA
    Gomis, SS
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 1998, 58 (01) : 159 - 166
  • [12] ON THE SET OF DIRECTIONS AT A POINT OF STRICT TANGENCY IN WHICH ONE CAN DRAW SHORTEST GEODESICS
    POLIKANOVA, IV
    SIBERIAN MATHEMATICAL JOURNAL, 1995, 36 (01) : 134 - 139
  • [13] What's the 'fracking' problem? One word can't say it all
    Evensen, Darrick
    Jacquet, Jeffrey B.
    Clarke, Christopher E.
    Stedman, Richard C.
    EXTRACTIVE INDUSTRIES AND SOCIETY-AN INTERNATIONAL JOURNAL, 2014, 1 (02): : 130 - 136
  • [14] An O(n log n) algorithm for the all-farthest-segments problem for a planar set of points
    Drysdale, R. L. Scot
    Mukhopadhyay, Asish
    INFORMATION PROCESSING LETTERS, 2007, 105 (02) : 47 - 51
  • [15] Opening a website at which one can get a benchmark input data set to solve the set covering problem
    Iwamura, K
    Okada, N
    Deguchi, Y
    Proceedings of the Second International Conference on Information and Management Sciences, 2002, 2 : 178 - 180
  • [16] Opening a web site at which one can get a benchmark input data set to solve the set covering problem
    Iwamura, Kakuzo
    Okada, Norio
    Deguchi, Yozo
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2005, 8 (03): : 395 - 401
  • [17] Description of the set of all possible masses at a fixed point of solutions of a truncated matricial Hamburger moment problem
    Fritzsche, Bernd
    Kirstein, Bernd
    Maedler, Conrad
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2024, 697 : 639 - 687
  • [18] When to start and stop hepatitis B treatment: Can one set of criteria apply to all patients regardless of age at infection?
    Degertekin, Bulent
    Lok, Anna S. F.
    ANNALS OF INTERNAL MEDICINE, 2007, 147 (01) : 62 - 64
  • [19] ANALYTIC REPRESENTATION OF ALL PLANAR TWO-LOOP FIVE-POINT MASTER INTEGRALS WITH ONE OFF-SHELL LEG
    Canko, Dhimiter D.
    Papadopoulos, Costas G.
    Syrrakos, Nikolaos
    ACTA PHYSICA POLONICA B, 2021, 52 (08): : 1091 - 1098
  • [20] Analytic representation of all planar two-loop five-point Master Integrals with one off-shell leg
    Canko, Dhimiter D.
    Papadopoulos, Costas G.
    Syrrakos, Nikolaos
    JOURNAL OF HIGH ENERGY PHYSICS, 2021, 2021 (01)
123