Related papers: A note on the sum-product problem for fractal sets

We show that if $B \subset \mathbb{R}^n$ and $E \subset A(n,k)$ is a nonempty collection of $k$-dimensional affine subspaces of $\mathbb{R}^n$ such that every $P \in E$ intersects $B$ in a set of Hausdorff dimension at least $\alpha$ with…

In this paper we construct a new family of sets based on Diophantine approximation in the Euclidean space, and consider their applications in several problems in harmonic analysis. Our first application is on the Hausdorff dimension of our…

We establish a $p$-adic analogue of a recent significant result of Ren-Wang (arXiv:2308.08819) on Furstenberg sets in the Euclidean plane. Building on the $p$-adic version of the high-low method from Chu (arXiv:2510.20104), we analyze…

We show a new method of estimating the Hausdorff measure (of the proper dimension) of a fractal set from below. The method requires computing the subsequent closest return times of a point to itself.

We prove a version of the Erd\H{o}s--Beck Theorem from discrete geometry for fractal sets in all dimensions. More precisely, let $X\subset \mathbb{R}^n$ Borel and $k \in [0, n-1]$ be an integer. Let $\dim (X \setminus H) = \dim X$ for every…

Let $A, B$, be finite subsets of an abelian group, and let $G \subset A \times B$ be such that $# A, # B, # \{a+b: (a,b) \in G \} \leq N$. We consider the question of estimating the quantity $# \{a-b: (a,b) \in G \}$. Recently Bourgain…

We present a new method to calculate the Hausdorff dimension of a certain class of fractals: boundaries of self-affine tiles. Among the interesting aspects are that even if the affine contraction underlying the iterated function system is…

By making use of arithmetic information inequalities, we give a strong quantitative bound for the discretised ring theorem. In particular, we show that if $A \subset [1,2]$ is a $(\delta,\sigma)$-set, with $|A| = \delta^{-\sigma},$ then…

In this paper we further study the relationship between convexity and additive growth, building on the work of Schoen and Shkredov (\cite{SS}) to get some improvements to earlier results of Elekes, Nathanson and Ruzsa (\cite{ENR}). In…

Given a fractal $\mathcal{I}$ whose Hausdorff dimension matches with the upper-box dimension, we propose a new method which consists in selecting inside $\mathcal{I}$ some subsets (called quasi-Cantor sets) of almost same dimension and with…

We prove that the Hausdorff dimension of the set $\mathbf{x}\in [0,1)^d$, such that $$ \left|\sum_{n=1}^N \exp\left(2 \pi i\left(x_1n+\ldots+x_d n^d\right)\right) \right|\ge c N^{1/2} $$ holds for infinitely many natural numbers $N$, is at…

Let $\gamma: [-1, 1]\to \mathbb{R}^n$ be a smooth curve that is non-degenerate. Take $m\le n$ and a Borel set $E\subset [0, 1]^n$. We prove that the orthogonal projection of $E$ to the $m$-th order tangent space of $\gamma$ at $\theta\in…

We consider fractal graphs invariant by a skew product $F:\mathbb{T}^k\times \mathbb{R}\rightarrow \mathbb{T}^k\times \mathbb{R}$ of the form $F(x,y)=(Ax, \lambda y+p(x))$ where $0<\lambda<1$, $p\colon\mathbb{T}^k\to\mathbb{R}$ is a…

In this paper, we use algorithmic tools, effective dimension and Kolmogorov complexity, to study the fractal dimension of distance sets. We show that, for any analytic set $E\subseteq\R^2$ of Hausdorff dimension strictly greater than one,…

We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…

We obtain positive lower bounds on the Hausdorff dimension of sets of real numbers given by expressions of the form $\sum_{n=1}^\infty \frac{1}{a_n b_n}$, where $b_n$ satisfies some growth condition and $a_n$ lies in some set, possibly…

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…

It is established that for any finite set of positive real numbers $A$, we have $$|A/A+A| \gg \frac{|A|^{\frac{3}{2}+\frac{1}{26}}}{\log^{1/2}|A|}.$$

We utilise the recent work of Orponen to yield a sum-product result for Ahlfors-regular sets. As a corollary, we obtain the fractal analogue of Solymosi's $4/3$-bound for finite subsets of $\mathbb{R}.$

In the present article a new class $\Upsilon$ of all sets represented in the following form is introduced: $$ \mathbb S_{(s,u)}\equiv\left\{x: x= \Delta^{s}_{{\underbrace{u...u}_{\alpha_1-1}} \alpha_1{\underbrace{u...u}_{\alpha_2…