betaFeedback

WorksMathematics

Three-ends Furstenberg estimates and approximate rectangles

Abstract

We prove a three-ends incidence estimate whose multiplicity exponent is sharp for one-dimensional Katz-Tao point sets.} At the heart of the argument lies rectangular non-concentration and its incidence theory introduced earlier by the authors. As an application, we obtain a strong quantitative bound on the number of approximate rectangles with the vertices belonging to four separated camps, each retaining a non-concentration condition.

Introduction

Much of the work in approximate incidence geometry has centred on the study of Furstenberg sets. A (δ,s,t,C)(\delta,s,t,C)-Furstenberg set is a collection T\mathcal{T} of δ\delta-tubes in the plane, where there exists a (δ,t,C)(\delta,t,C)-set of points PP in the plane so that through each point p∈Pp \in P there exists a (δ,s,C)(\delta,s,C)-set T(p)⊂T\mathcal{T}(p) \subset\mathcal{T} of tubes incident to pp.

For planar point configurations we work in a fixed bounded region, normalised to [0,1]2[0,1]^2. Point sets are δ\delta-separated, and tube families are δ\delta-separated in line parameter space, as specified in § 2. All distances between line directions are measured modulo π\pi.

The following sharp lower bound up to exponent for the number of tubes was obtained by [11] building on the work of [7]. We invite the reader to view the two aforementioned papers, along with the references therein, to view the colourful history of the problem of finding the sharp lower bound which has generated a rich body of mathematics over the last thirty years or so.

Theorem 1.1 (Orponen–Shmerkin; Ren–Wang). Let 0<s≤10 < s \le1 and 0<t<20 < t < 2. For every η>0\eta> 0 there exists ϵ0=ϵ0(s,t,η)>0\epsilon_0 = \epsilon_0(s,t,\eta) > 0 such that the following holds whenever 0<ϵ≤ϵ00 < \epsilon\le\epsilon_0 and δ>0\delta> 0 is sufficiently small.

Let T\mathcal{T} be a (δ,s,t,δ−ϵ)(\delta,s,t,\delta^{-\epsilon})-Furstenberg set. Let MM be an integer with the property that ∣T(p)∣≥M|\mathcal{T}(p)| \ge M for each p∈Pp \in P. Then

∣T∣≳ηδηMδ−f(s,t),|\mathcal{T}| \gtrsim_{\eta} \delta^{\eta}M\delta^{-f(s,t)},

where

f(s,t)=min⁡{s+t2,t,1}.f(s,t) = \min\left\{\frac{s+t}{2},t,1\right\}.

Some further research directions have centred upon weakening some of the assumptions in the statement of Theorem 1.1. In one direction, one may ask what happens if the assumption on PP is weakened. If PP is only δ\delta-separated, then the best one may obtain is

∣T∣≳ϵδO(ϵ)M∣P∣.(1)|\mathcal{T}| \gtrsim_{\epsilon} \delta^{O(\epsilon)}M\sqrt{|P|}. \tag*{(1)}

see Proposition 2.2. This bound may be seen to be sharp if one considers a collection PP maximally clustered, that is, being contained in a ball of radius ∼δ∣P∣1/2\sim\delta|P|^{1/2}. Provided this is not the case, in some weakly quantitative way, then one may improve upon (1). This was established in [6] and we invite the reader to view their well-written and clear paper.

In a different direction, one may choose to keep the non-concentration assumption on PP, but weaken or alter the assumption on the T(p)\mathcal{T}(p). One example is to ask that each T(p)\mathcal{T}(p) satisfies a certain quantitative two-ends assumption. In the case t=1t=1, for any fixed s∈(0,1]s\in(0,1] and any η>0\eta>0, taking the input loss parameter ϵ\epsilon sufficiently small in terms of s,ηs,\eta gives

∣T∣≳s,ηδηM3/2δ−1/2.|\mathcal{T}|\gtrsim_{s,\eta}\delta^\eta M^{3/2}\delta^{-1/2}.

This is due to [14], generalised to other values of tt in [15]. When t≠1t\ne1 one also needs another notion of non-concentration on the T(p)\mathcal{T}(p). See Theorem 2.4 for the full statement. The hypotheses of their statement are not formally weaker, although morally they may be considered that way.

The question still remains: What is the weakest condition one may place on the T(p)\mathcal{T}(p) to improve upon (1) at the level of exponents? We provide a condition in Definition 1.2 below which is rather weak but sufficient.

Incidence theorems

Definition 1.2. Let T\mathcal{T} be a collection of δ\delta-tubes, PP a collection of δ\delta-separated points, M≥1M\ge1 an integer, and c>0c>0. We say that (P,T)(P,\mathcal{T}) is (M,c)(M,c)-three-ends if for every p∈Pp\in P, there are subfamilies

T1(p),T2(p),T3(p)⊂{T∈T:T∩p≠∅},\mathcal{T}_1(p),\mathcal{T}_2(p),\mathcal{T}_3(p)\subset\{T\in\mathcal{T}:T\cap p\ne\varnothing\},

so that

∣Ti(p)∣≥Mfor all i=1,2,3,|\mathcal{T}_i(p)|\ge M\quad\text{for all }i=1,2,3,

and

∠(T,T′)≥cif T∈Ti(p), T′∈Tj(p), i≠j.\angle(T,T')\ge c\quad\text{if }T\in\mathcal{T}_i(p),\ T'\in\mathcal{T}_j(p),\ i\ne j.

Here ∠(T,T′)\angle(T,T') is the angle between the centre-lines of TT and T′T'.

If instead of three families we only have two, (P,T)(P,\mathcal{T}) will be referred to as (M,c)(M,c)-two-ends. This is a non-quantitative version of the quantitative two-ends structure investigated earlier in literature.

Set

σ=min⁡{s,2−s}.\sigma=\min\{s,2-s\}.

Theorem 1.3. Fix 0<s<20<s<2, ϵ>0\epsilon>0. Let PP be a (δ,s)(\delta,s)-KT-set with ∣P∣∼δ−s|P|\sim\delta^{-s}. Suppose that (P,T)(P,\mathcal{T}) is (M,δϵ)(M,\delta^\epsilon)-three-ends. Then

∣T∣≳ϵδO(ϵ)M1+σ/4∣P∣.|\mathcal{T}|\gtrsim_\epsilon\delta^{O(\epsilon)}M^{1+\sigma/4}\sqrt{|P|}.

The gain from three vs. two families of tubes can be seen by comparing it with Proposition 2.2.

For s=1s=1, the exponent 5/45/4 of MM in Theorem 1.3 is sharp (as a universal exponent that works for all MM). The following multiscale construction was communicated to us by Tuomas Orponen. It shows the sharpness of 5/45/4 when M∼δ−2/3M\sim\delta^{-2/3}.

Set ρ=δ1/3\rho=\delta^{1/3}. Its geometry is illustrated in Figure 1. We pack a larger vertical block with thin horizontal rectangles. The three tube families are represented by lines: the red lines run more or less along the long directions of the horizontal rectangles (with the small angular variation permitted by their eccentricity), the blue lines run along the long direction of the larger vertical block, and the dark lines go through one of the clusters. The three direction families are quantitatively transverse.

The scales are chosen so that

∣P∣∼δ−1,∣Ti∣∼δ−4/3,∣Ti(p)∣∼M=δ−2/3(p∈P)(2)|P| \sim\delta^{-1}, \qquad|\mathcal{T}_i| \sim\delta^{-4/3}, \qquad|\mathcal{T}_i(p)| \sim M = \delta^{-2/3} \quad(p \in P) \tag*{(2)}

for each of the three colours. For an explicit configuration, take an integer n≥2n \ge2, put δ=n−3\delta= n^{-3}, ρ=n−1\rho= n^{-1}, and

P={(aρ2+bδ,cρ+bδ):a,b,c∈{0,…,n−1}}.P = \left\{(a\rho^2+b\delta,c\rho+b\delta):a,b,c \in\{0,\ldots,n-1\}\right\}.

Rows are separated vertically by ρ\rho, clusters within a row horizontally by ρ2\rho^2, and points within a cluster by 2δ\sqrt{2}\delta along a 45∘45^\circ line. The bound ∣P∩B(x,r)∣≲r/δ|P \cap B(x,r)| \lesssim r/\delta follows by considering δ≤r≤ρ2\delta\le r \le\rho^2, ρ2≤r≤ρ\rho^2 \le r \le\rho, and ρ≤r≤1\rho\le r \le1. For the red, black and blue families, respectively, take the tubes meeting PP from a δ\delta-net in line parameter space with direction windows of width c0ρc_0\rho about 0,π/4,π/20,\pi/4,\pi/2, where c0>0c_0 > 0 is a small fixed constant. Each point meets ∼ρ/δ=δ−2/3\sim\rho/\delta=\delta^{-2/3} tubes of each colour. There are ∼δ−1\sim\delta^{-1} red tubes per row, ∼δ−2/3\sim\delta^{-2/3} black tubes per cluster, and ∼δ−4/3\sim\delta^{-4/3} blue tubes in total. These counts give (1.2).

The sharpness example, showing red, black and blue tube families intersecting a clustered point configuration

Figure 1. The sharpness example, redrawn from the communicated sketch.

Indeed,

δ−1/2M5/4=δ−1/2(δ−2/3)5/4=δ−4/3,\delta^{-1/2}M^{5/4}=\delta^{-1/2}\left(\delta^{-2/3}\right)^{5/4}=\delta^{-4/3},

which is exactly the size of each tube family in (1.2). Thus the exponent 5/45/4 cannot be improved in general without adding new hypotheses.

We state the following more general version where PP need not have the ‘correct’ cardinality for its dimension, and may have a large Katz–Tao constant.

Proposition 1.4. Fix 0<s<20 < s < 2, C≥1C \ge1, ϵ>0\epsilon> 0. Let M≥1M \ge1 be an integer. Let PP be a (δ,s,C)(\delta, s, C)-KT-set. Suppose that (P,T)(P, \mathcal{T}) is (M,δϵ)(M, \delta^{\epsilon})-three-ends. Then

∣T∣≳ϵC−3/4M1+σ/4δs/4+O(ϵ)∣P∣3/4.|\mathcal{T}| \gtrsim_{\epsilon} C^{-3/4} M^{1+\sigma/4} \delta^{s/4+O(\epsilon)} |P|^{3/4}.

We will prove Proposition 1.4 when C∼1C \sim1. The general case follows easily from an application of [3 Lemma 2.7, Lemma 2.8]. Indeed, after an application of both, one finds a P′⊂PP' \subset P with ∣P′∣≳δO(ϵ)∣P∣/C|P'| \gtrsim\delta^{O(\epsilon)}|P|/C, which is a (δ,s,Oϵ(1))(\delta, s, O_{\epsilon}(1))-KT set. Applying Proposition 1.4 with P′P' gives the desired result.

Let us now show some applications, that have motivated our study of the three-ends phenomenon.

Approximate rectangles

Let S1,S2,S3,S4S_1, S_2, S_3, S_4 be disjoint sets in [0,1]2[0,1]^2. We say that (p1,p2,p3,p4)∈S1×S2×S3×S4(p_1,p_2,p_3,p_4) \in S_1 \times S_2 \times S_3 \times S_4 is a δ\delta-approximate rectangle if

∣p1−p2+p3−p4∣=O(δ),(3)|p_1-p_2+p_3-p_4| = O(\delta), \tag*{(3)}

and

References

  1. [1][BD15] Jean Bourgain and Ciprian Demeter. The proof of the l² decoupling conjecture. Ann. of Math. (2), 182(1):351–389, 2015.arxiv.org/abs/1403.5335
  2. [2][DO25] Ciprian Demeter and William O’Regan. Incidence estimates for quasi-product sets and applications. arXiv:2511.15899, 2025.arxiv.org/abs/2511.15899
  3. [3][DW25] Ciprian Demeter and Hong Wang. Szeméredi-Trotter bounds for tubes and applications. Ars Inven. Anal., pages Paper No. 1, 46, 2025.
  4. [4]Yuqiu Fu and Kevin Ren. Incidence estimates for α-dimensional tubes and β-dimensional balls in ℝ². J. Fractal Geom., 11(1-2):1–30, 2024.
  5. [5]Tuomas Orponen. Additive properties of fractal sets on the parabola. Ann. Fenn. Math., 48(1):113–139, 2023.arxiv.org/abs/2205.02770
  6. [6]Tuomas Orponen and Pablo Shmerkin. Furstenberg-type estimates under mild non-concentration assumptions. Math. Proc. Cambridge Philos. Soc., 2026. To appear. arXiv:2603.19171.arxiv.org/abs/2603.19171
  7. [7]Tuomas Orponen and Pablo Shmerkin. Projections, Furstenberg sets, and the ABC sum-product problem. J. Amer. Math. Soc., 39(3):857–913, 2026.
  8. [8]William O’Regan, Shukun Wu, and Guangzeng Yi. Two-ends Furstenberg inequality for transversal families and applications to Fourier decay. arXiv:2607.08461, 2026.arxiv.org/abs/2607.08461
  9. [9]Tuomas Orponen and Guangzeng Yi. Large cliques in extremal incidence configurations. Rev. Mat. Iberoam., 41(4):1431–1460, 2025.arxiv.org/abs/2402.12104
  10. [10]János Pach and Micha Sharir. Repeated angles in the plane and related problems. J. Combin. Theory Ser. A, 59(1):12–22, 1992.DOI
  11. [11]Kevin Ren and Hong Wang. Furstenberg sets estimate in the plane. arXiv:2308.08819, 2023.arxiv.org/abs/2308.08819
  12. [12]Pablo Shmerkin. A non-linear version of Bourgain’s projection theorem. J. Eur. Math. Soc. (JEMS), 25(10):4155–4204, 2023.DOI
  13. [13]Terence Tao. An Epsilon of Room, II: Pages from Year Three of a Mathematical Blog. American Mathematical Society, Providence, RI, 2011.
  14. [14]Hong Wang and Shukun Wu. Restriction estimates using decoupling theorems and two-ends Furstenberg inequalities. arXiv:2411.08871, 2024.arxiv.org/abs/2411.08871
  15. [15]Hong Wang and Shukun Wu. Two-ends Furstenberg estimates in the plane. Math. Ann., 395(4):Paper No. 91, 2026.arxiv.org/abs/2509.21869

Paper details

vlnc:W_aut7nqq4
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 15

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT-6, AI

View statement
Looking for related papers…
Contents