An improved bound on the packing dimension of Furstenberg sets in the plane

被引:7
|
作者
Orponen, Tuomas [1 ]
机构
[1] Univ Helsinki, Dept Math & Stat, Helsinki, Finland
基金
芬兰科学院;
关键词
Furstenberg sets; projections; packing dimension; PROJECTIONS; CONJECTURE;
D O I
10.4171/JEMS/933
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let 0 <= s <= 1. A set K subset of R-2 is a Furstenberg s-set if for every unit vector e is an element of S-1, some line L-e parallel to e satisfies dim(H) [K boolean AND L-e] >= s. The Furstenberg set problem, introduced by T. Wolff in 1999, asks about the best lower bound for the dimension of Furstenberg s-sets. Wolff proved that dim(H) K >= max {s + 1/2, 2s} and conjectured that dim(H) K >= (1 + 3s)/2. The only known improvement to Wolff's bound is due to Bourgain, who proved in 2003 that dim(H) K >= 1 + epsilon for Furstenberg 1/2-sets K, where epsilon > 0 is an absolute constant. In the present paper, I prove a similar epsilon-improvement for all 1/2 < s < 1, but only for packing dimension: dim(p) K >= 2s + epsilon for all Furstenberg s-sets K subset of R-2, where epsilon > 0 only depends on s. The proof rests on a new incidence theorem for finite collections of planar points and tubes of width delta > 0. As another corollary of this theorem, I obtain a small improvement for Kaufman's estimate from 1968 on the dimension of exceptional sets of orthogonal projections. Namely, I prove that if K subset of R-2 is a linearly measurable set with positive length, and 1/2 < s < 1, then dim(H) {e is an element of S-1 : dim(p) pi(e)(K) <= s} <= s - epsilon for some epsilon > 0 depending only on s. Here pi(e) is the orthogonal projection onto the line spanned by e.
引用
收藏
页码:797 / 831
页数:35
相关论文
共 50 条
  • [31] An improved bound for the dimension of subfield subcodes
    Shibuya, T
    Matsumoto, R
    Sakaniwa, K
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (05) : 876 - 880
  • [32] An improved lower bound for the bin packing problem
    Chen, BT
    Srivastava, B
    [J]. DISCRETE APPLIED MATHEMATICS, 1996, 66 (01) : 81 - 94
  • [33] Improved Lower Bound for Online Strip Packing
    Rolf Harren
    Walter Kern
    [J]. Theory of Computing Systems, 2015, 56 : 41 - 72
  • [34] Improved Lower Bound for Online Strip Packing
    Harren, Rolf
    Kern, Walter
    [J]. THEORY OF COMPUTING SYSTEMS, 2015, 56 (01) : 41 - 72
  • [35] Packing dimension and Ahlfors regularity of porous sets in metric spaces
    Esa Järvenpää
    Maarit Järvenpää
    Antti Käenmäki
    Tapio Rajala
    Sari Rogovin
    Ville Suomala
    [J]. Mathematische Zeitschrift, 2010, 266 : 83 - 105
  • [36] Packing dimension and Ahlfors regularity of porous sets in metric spaces
    Jarvenpaa, Esa
    Jarvenpaa, Maarit
    Kaenmaki, Antti
    Rajala, Tapio
    Rogovin, Sari
    Suomala, Ville
    [J]. MATHEMATISCHE ZEITSCHRIFT, 2010, 266 (01) : 83 - 105
  • [37] An improved bound onk-sets
    Abhi Dattasharma
    [J]. Resonance, 1997, 2 (11) : 97 - 101
  • [38] FURSTENBERG SETS FOR A FRACTAL SET OF DIRECTIONS
    Molter, Ursula
    Rela, Ezequiel
    [J]. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2012, 140 (08) : 2753 - 2765
  • [39] Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
    Lutz, Jack H.
    Lutz, Neil
    [J]. 34TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2017), 2017, 66
  • [40] Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
    Lutz, Jack H.
    Lutz, Neil
    [J]. ACM TRANSACTIONS ON COMPUTATION THEORY, 2018, 10 (02)