Definition

Fix an integer L3L\ge3. Partition [1,1]d[-1,1]^d at depth nn into congruent cubes of side length proportional to LnL^{-n}. A set X[1,1]dX\subseteq[-1,1]^d is box porous at scale LL with depth nn if every depth-nn cube QQ meeting XX contains a depth-(n+1) child cube QQQ'\subset Q with QX=Q'\cap X=\varnothing.

Iterated form

If the condition holds at depths 0,,N10,\ldots,N-1, then at least one of the LdL^d children is discarded at every occupied node. Consequently

X2d(1Ld)N,|X|\le 2^d(1-L^{-d})^N,

where X|X| denotes .

Comparison with ball porosity

A set that is ν\nu- down to scale hh is box porous at all depths with LnhL^{-n}\gtrsim h, for a choice Ldν1L\asymp_d\nu^{-1}. Box porosity is useful because the preceding counting estimate turns geometric holes into a power-law volume bound.

References
  1. Rui Han and Wilhelm Schlag, “A higher-dimensional Bourgain–Dyatlov fractal uncertainty principle,” Analysis & PDE 13 (2020), 813–863. DOI record.
  2. Alex Cohen, “Fractal uncertainty in higher dimensions,” 2024. arXiv record. Relevant: Appendix A.1.