Related papers: Intersection patterns and connections to distance …

We give conditions on a general family $P_{\lambda}:\R^n\to\R^m, \lambda \in \Lambda,$ of orthogonal projections which guarantee that the Hausdorff dimension formula $\dim A\cap P_{\lambda}^{-1}\{u\}=s-m$ holds generically for measurable…

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

Set systems with strongly restricted intersections, called $\alpha$-intersecting families for a vector $\alpha$, were introduced recently as a generalization of several well-studied intersecting families including the classical oddtown and…

We introduce a class of Falconer distance problems, which we call of restricted type, lying between the classical version and its pinned variant. Prototypical restricted distance sets are the diagonal distance sets, $k$-point configuration…

We isolate conditions on the relative size of sets of natural numbers $A,B$ that guarantee a nonempty intersection $\Delta(A)\cap\Delta(B)\ne\emptyset$ of the corresponding sets of distances. Such conditions apply to a large class of zero…

We show that every invertible strong mixing transformation on a Lebesgue space has strictly over-recurrent sets. Also, we give an explicit procedure for constructing strong mixing transformations with no under-recurrent sets. This answers…

An orthogonality space is a set together with a symmetric and irreflexive binary relation. Any linear space equipped with a reflexive and anisotropic inner product provides an example: the set of one-dimensional subspaces together with the…

In this paper we will look at the connection of frames and finite dimensionality. A main focus is to present simple algorithms and make them available online. The main result is a way to 'switch' between different frames, giving an…

This thesis establishes new quantitative records in several problems of incidence geometry and growth. After the necessary background in Chapters 1, 2 and 3, the following results are proven. Chapter 4 gives new results in the incidence…

The famous Erd\H{o}s distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

We study dimensions of sumsets and iterated sumsets and provide natural conditions which guarantee that a set $F \subseteq \mathbb{R}$ satisfies $\overline{\dim}_\text{B} F+F > \overline{\dim}_\text{B} F$ or even $\dim_\text{H} n F \to 1$.…

Let $K$ be a compact convex set in $\mathbb{R}^2$ and let $\mathcal{F}_1, \mathcal{F}_2, \mathcal{F}_3$ be finite families of translates of $K$ such that $A \cap B \neq \emptyset$ for every $A \in \mathcal{F}_i$ and $B \in \mathcal{F}_j$…

Let F be a family of Borel measurable functions on a complete separable metric space. The gap (or fat-shattering) dimension of F is a combinatorial quantity that measures the extent to which functions f in F can separate finite sets of…

Let $\mathbb{F}_q$ be a finite field of order $q$ and $\mathcal{E}$ be a set in $\mathbb{F}_q^d$. The distance set of $\mathcal{E}$, denoted by $\Delta(\mathcal{E})$, is the set of distinct distances determined by the pairs of points in…

An $\epsilon$-approximate incidence between a point and some geometric object (line, circle, plane, sphere) occurs when the point and the object lie at distance at most $\epsilon$ from each other. Given a set of points and a set of objects,…

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

The recent breakthrough of Guth, Iosevich, Ou, and Wang (2019) on the Falconer distance problem states that for a compact set $A\subset \mathbb{R}^2$, if the Hausdorff dimension of $A$ is greater than $\frac{5}{4}$, then the distance set…

Let us say that an element of a given family $\A$ of subsets of $\R^d$ can be reconstructed using $n$ test sets if there exist $T_1,...,T_n \subset \R^d$ such that whenever $A,B\in \A$ and the Lebesgue measures of $A \cap T_i$ and $B \cap…

We introduce a definition of thickness in $\mathbb{R}^d$ and obtain a lower bound for the Hausdorff dimension of the intersection of finitely or countably many thick compact sets using a variant of Schmidt's game. As an application we prove…