Hilbert cubes in progression-free sets and in the set of squares II
Rainer Dietmann, Christian Elsholtz

TL;DR
This paper proves that the dimension of Hilbert cubes contained within the set of perfect squares up to N is bounded by a double logarithmic function, advancing understanding of additive structures in sparse sets.
Contribution
It establishes a new upper bound on the dimension of Hilbert cubes within the squares, showing it grows at most logarithmically double in the size of the set.
Findings
Dimension of Hilbert cubes in squares is O(log log N)
Provides bounds on additive structures in sparse sets
Advances understanding of progression-free subsets in squares
Abstract
Let be the set of integer squares. We show that the dimension of a Hilbert cube is bounded by
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 Topology and Set Theory · Mathematical Dynamics and Fractals
