Remarks on the construction of $K_\sigma$ sets associated to trees not satisfying a separation condition
Paul Hagelstein, Blanca Radillo-Murguia, and Alex Stokolos

TL;DR
This paper examines the limitations of using $K_\sigma$ sets associated with sticky maps in the construction of Kakeya-type sets, showing that certain trees prevent these sets from having small measure intersections.
Contribution
It demonstrates that for any given lacunary tree, all sticky maps produce $K_\sigma$ sets with large measure intersection, revealing constraints in the probabilistic construction method.
Findings
Sticky maps cannot produce small measure $K_\sigma$ sets for certain trees.
Lacunary trees of finite height limit the effectiveness of $K_\sigma$ set constructions.
The approach has inherent limitations in constructing measure-zero Kakeya-type sets.
Abstract
sets involving sticky maps have been used in the theory of differentiation of integrals to probabilistically construct Kakeya-type sets that imply certain types of directional maximal operators are unbounded on for all . We indicate limits to this approach by showing that, given and a natural number , there exists a tree of finite height that is lacunary of order but such that, for \emph{every} sticky map , one has .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Mathematical Approximation and Integration
