Related papers: Dimensional lower bounds for Falconer type inciden…

Let $(X, d)$ be a compact metric space, and let $Q \subset X$ be countable. Given functions $R: Q \to \mathbb{R}^+$ and $\phi: \mathbb{R}^+ \to \mathbb{R}^+$, we consider the set $E(Q, R, \phi)$ of points $x \in X$ that ``hit'' the…

We define two notions of discrete dimension based on the Minkowski and Hausdorff dimensions in the continuous setting. After proving some basic results illustrating these definitions, we apply this machinery to the study of connections…

We highlight a connection between Diophantine approximation and the lower Assouad dimension by using information about the latter to show that the Hausdorff dimension of the set of badly approximable points that lie in certain non-conformal…

We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is restricted to a contineus region ($\impre$ model) or a…

A great challenge in the analysis of the discrepancy function D_N is to obtain universal lower bounds on the L-infty norm of D_N in dimensions d \geq 3. It follows from the average case bound of Klaus Roth that the L-infty norm of D_N is at…

We prove new bounds on the dimensions of distance sets and pinned distance sets of planar sets. Among other results, we show that if $A\subset\mathbb{R}^2$ is a Borel set of Hausdorff dimension $s>1$, then its distance set has Hausdorff…

We consider the deviation inequalities for the sums of independent $d$ by $d$ random matrices, as well as rank one random tensors. Our focus is on the non-isotropic case and the bounds that do not depend explicitly on the dimension $d$, but…

We establish a new connection between metric Diophantine approximation and the parametric geometry of numbers by proving a variational principle facilitating the computation of the Hausdorff and packing dimensions of many sets of interest…

Singular vectors are those for which the quality of rational approximations provided by Dirichlet's Theorem can be improved by arbitrarily small multiplicative constants. We provide an upper bound on the Hausdorff dimension of singular…

The classical Painlev\'e theorem tells that sets of zero length are removable for bounded analytic functions, while (some) sets of positive length are not. For general $K$-quasiregular mappings in planar domains the corresponding critical…

A celebrated unit distance conjecture due to Erd\H os says that that the unit distances cannot arise more than $C_{\epsilon}n^{1+\epsilon}$ times (for any $\epsilon>0$) among $n$ points in the Euclidean plane (see e.g. \cite{SST84} and the…

To measure the shape similarity of point sets, various notions of the Hausdorff distance under translation are widely studied. In this context, for an $n$-point set $P$ and $m$-point set $Q$ in $\mathbb{R}^d$, we consider the task of…

For any j_1,...,j_n>0 with j_1+...+j_n=1 and any x \in R^n, we consider the set of points y \in R^n for which max_{1\leq i\leq n}(||qx_i-y_i||^{1/j_i})>c/q for some positive constant c=c(y) and all q\in N. These sets are the `twisted'…

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

Let S be a set of n >= d points in general position in R^d. An oriented (d-1)-simplex spanned by d points from S is called a k-facet iff the positive side of its affine hull contains exactly k points from S. A (<=k)-facet is simply an…

Let $\psi : \mathbb{R}_{>0}\rightarrow \mathbb{R}_{>0}$ be a non-increasing function. Denote by $W(\psi)$ the set of $\psi$-well-approximable points and by $E(\psi)$ the set of points $x\in[0,1]$ such that for any $0 < \epsilon < 1$ there…

We obtain new lower bounds on the Hausdorff dimension of distance sets and pinned distance sets of planar Borel sets of dimension slightly larger than $1$, improving recent estimates of Keleti and Shmerkin, and of Liu in this regime. In…

Recently, generalizations of the classical Three Gap Theorem to higher dimensions attracted a lot of attention. In particular, upper bounds for the number of nearest neighbor distances have been established for the Euclidean and the maximum…

We consider badly approximable numbers in the case of dyadic diophantine approximation. For the unit circle $\mathbb{S}$ and the smallest distance to an integer $\|\cdot\|$ we give elementary proofs that the set $F(c) = \{x \in \mathbb{S}:…

Bennett, Hart, Iosevich, Pakianathan, and Rudnev found an exponent $s<d$ such that any set $E\subset \mathbb{F}_q^d$ with $|E|\gtrsim q^s$ determines $\gtrsim q^{\binom{k+1}{2}}$ congruence classes of $(k+1)$-point configurations for $k\leq…