Israel Journal of Mathematics

, Volume 152, Issue 1, pp 157–179

Distance sets of well-distributed planar sets for polygonal norms

Article
  • 77 Downloads

Abstract

LetX be a two-dimensional normed space, and letBX be the unit ball inX. We discuss the question of how large the set of extremal points ofBX may be ifX contains a well-distributed set whose distance set Δ satisfies the estimate |Δ∩[0,N]|≤CN3/2-ε. We also give a necessary and sufficient condition for the existence of a well-distributed set with |Δ∩[0,N]|≤CN.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [B99]
    J. Bourgain,On the dimension of Kakeya sets and related maximal inequalities, Geometric and Functional Analysis9 (1999), 256–282.MATHCrossRefMathSciNetGoogle Scholar
  2. [EE94]
    G. Elekes and P. Erdős,Similar configurations and pseudo grids, inIntuitive Geometry (Szeged, 1991), Colloquia Mathematica Societatis János Bolyai, 63, North-Holland, Amsterdam, 1994, pp. 85–104.Google Scholar
  3. [E46]
    P. Erdős,On sets of distances of n points, The American Mathematical Monthly53 (1946), 248–250.CrossRefMathSciNetGoogle Scholar
  4. [Fa04]
    K. J. Falconer,Dimensions of intersections and distance sets for polyhedral norms, preprint, 2004.Google Scholar
  5. [F73]
    G. Freiman,Foundations of a Structural Theory of Set Addition (translation from Russian), Translations of Mathematical Monographs, Vol. 37, American Mathematical Society, Providence, RI, 1973.MATHGoogle Scholar
  6. [G04]
    J. Garibaldi,Erdős Distance Problem for Convex Metrics, Ph.D. thesis, UCLA, 2004.Google Scholar
  7. [I01]
    A. Iosevich,Curvature, combinatorics and the Fourier transform, Notices of the American Mathematical Society46 (2001), 577–583.MathSciNetGoogle Scholar
  8. [IŁ03]
    A. Iosevich and I. Łaba,Distance sets of well-distributed planar point sets, Discrete and Computational Geometry31 (2004), 243–250.MATHCrossRefMathSciNetGoogle Scholar
  9. [IŁ04]
    A. Iosevich and I. Łaba,K-distance sets, Falconer conjecture and discrete analogs, Integers: Electronic Journal of Combinatorial Number Theory, to appear.Google Scholar
  10. [KT04]
    N. H. Katz and G. Tardos,A new entropy inequality for the Erdős distance problem, inTowards a Theory of Geometric Graphs (J. Pach, ed.), Contemporary Mathematics, Vol. 342, American Mathematical Society, Providence, RI, 2004.Google Scholar
  11. [LR96]
    M. Laczkovich and I. Z. Ruzsa,The number of homothetic subsets, inThe Mathematics of Paul Erdős, II, Algorithms and Combinatorics, 14, Springer, Berlin, 1997, pp. 294–302.Google Scholar
  12. [N96]
    M. Nathanson,Additive Number Theory, II: Inverse Problems and the Geometry of Sumsets, Springer-Verlag, New York, 1996.Google Scholar
  13. [Ru94]
    I. Ruzsa,Sum of sets in several dimensions, Combinatorica14 (1994), 485–490.MATHCrossRefMathSciNetGoogle Scholar
  14. [ST01]
    J. Solymosi and Cs. Tóth,Distinct distances in the plane, Discrete and Computational Geometry25 (2001), 629–634.MATHMathSciNetGoogle Scholar
  15. [SV04]
    J. Solymosi and V. Vu,Distinct distances in high dimensional homogeneous sets, inTowards a Theory of Geometric Graphs (J. Pach, ed.), Contemporary Mathematics, Vol. 342, American Mathematical Society, Providence, RI, 2004.Google Scholar
  16. [W99]
    T. Wolff,Decay of circular means of Fourier transforms of measures, International Mathematics Research Notices10 (1999), 547–567.CrossRefMathSciNetGoogle Scholar

Copyright information

© The Hebrew University Magnes Press 2006

Authors and Affiliations

  1. 1.Department of Mechanics and MathematicsMoscow State UniversityMoscowRussia
  2. 2.Department of MathematicsUniversity of British ColumbiaVancouverCanada

Personalised recommendations