Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the discretised $ABC$ sum-product problem

Published 6 Oct 2021 in math.CO, math.MG, and math.NT | (2110.02779v3)

Abstract: Let $0 < \beta \leq \alpha < 1$ and $\kappa > 0$. I prove that there exists $\eta > 0$ such that the following holds for every pair of Borel sets $A,B \subset \mathbb{R}$ with $\dim_{\mathrm{H}} A = \alpha$ and $\dim_{\mathrm{H}} B = \beta$: $$\dim_{\mathrm{H}} {c \in \mathbb{R} : \dim_{\mathrm{H}} (A + cB) \leq \alpha + \eta} \leq \tfrac{\alpha - \beta}{1 - \beta} + \kappa.$$ This extends a result of Bourgain from 2010, which contained the case $\alpha = \beta$. The paper also contains a $\delta$-discretised, and somewhat stronger, version of the estimate above, and new information on the size of long sums of the form $a_{1}B + \ldots + a_{n}B$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.