Related papers: A Continuum Erd\H{o}s-Beck Theorem

In this paper, using the compression method, we recover the lower bound for the Erd\H{o}s unit distance problem and provide an alternative proof to the distinct distance conjecture. In particular, in $\mathbb{R}^k$ for all $k\geq 2$, we…

We provide several new answers on the question: how do radial projections distort the dimension of planar sets? Let $X,Y \subset \mathbb{R}^{2}$ be non-empty Borel sets. If $X$ is not contained on any line, we prove that \[ \sup_{x \in X}…

According to the Erd\H{o}s-Szekeres theorem, for every $n$, a sufficiently large set of points in general position in the plane contains $n$ in convex position. In this note we investigate the line version of this result, that is, we want…

We prove a sharp continuum Beck-type theorem for hyperplanes. Our work is inspired by foundational work of Beck on the discrete problem, as well as refinements due to Do and Lund. The inductive proof uses recent breakthrough results in…

In this paper, we prove that if $S\subseteq\mathbb{R}^d$ is hyperplane absolute winning on a closed hyperplane diffuse set $L\subseteq\mathbb{R}^d$, then $\mathrm{dim}_H S\cap K=\mathrm{dim}_H K$ for any irreducible self-conformal set…

We improve the best known lower bound for the dimension of radial projections of sets in the plane. We show that if $X,Y$ are Borel sets in $\R^2$, $X$ is not contained in any line and $\dim_H(X)>0$, then $$\sup\limits_{x\in X} \dim_H(\pi_x…

We prove two conjectures in this paper. The first conjecture is by Lund, Pham and Thu: Given a Borel set $A\subset \mathbb{R}^n$ such that $\dim A\in (k,k+1]$ for some $k\in\{1,\dots,n-1\}$. For $0<s<k$, we have \[ \text{dim}(\{y\in…

A variant of the Erd\H{o}s-S\'os conjecture, posed by Havet, Reed, Stein and Wood, states that every graph with minimum degree at least $\lfloor 2k/3 \rfloor$ and maximum degree at least $k$ contains a copy of every tree with $k$ edges.…

We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…

We make progress on two interrelated problems at the intersection of geometric measure theory, additive combinatorics and harmonic analysis: the discretised sum-product problem, and the dimension of Furstenberg sets. Along the way, we…

Our aim is to find the minimal Hausdorff dimension of the union of scaled and/or rotated copies of the $k$-skeleton of a fixed polytope centered at the points of a given set. For many of these problems, we show that a typical arrangement in…

We prove two new exceptional set estimates for radial projections in the plane. If $K \subset \mathbb{R}^{2}$ is a Borel set with $\dim_{\mathrm{H}} K > 1$, then $$\dim_{\mathrm{H}} \{x \in \mathbb{R}^{2} \, \setminus \, K :…

We study the spectral Tur\'an problem for trees. To avoid limiting our perspective to specific families of trees, we parametrize trees in terms of their unique bipartition. We say $T \in \mathcal{T}_{m,l+1}^{\delta}$ if $T$ is a tree of…

The basic theme of this paper is the fact that if $A$ is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also…

The Erd\H{o}s-Anning theorem states that every point set in the Euclidean plane with integer distances must be either collinear or finite. More strongly, for any (non-degenerate) triangle of diameter~$\delta$, at most $O(\delta^2)$ points…

This paper develops a comprehensive theory of optimal transport for signed (real) measures on Rd. Extending the classical Brenier theorem, we consider Jordan decompositions of measures with possibly fractal singular parts. Under suitable…

For each $d \in {1,2,3,7,11}$, let $T_d$ be the nearest-integer complex continued fraction map associated with the Euclidean ring $\mathcal{O}*d$, and let $(a_n)$ be its digit sequence. We prove two metric results for this five-system…

In this paper, we give improved bounds on the Hausdorff dimension of pinned distance sets of planar sets with dimension strictly less than one. As the planar set becomes more regular (i.e., the Hausdorff and packing dimension become…

Let $0 \leq s \leq 1$. A set $K \subset \mathbb{R}^{2}$ is a Furstenberg $s$-set, if for every unit vector $e \in S^{1}$, some line $L_{e}$ parallel to $e$ satisfies $$\dim_{\mathrm{H}} [K \cap L_{e}] \geq s.$$ The Furstenberg set problem,…

This paper considers an extremal version of the Erd\H{o}s distinct distances problem. For a point set $P \subset \mathbb R^d$, let $\Delta(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if…