English
Related papers

Related papers: On distance sets, box-counting and Ahlfors-regular…

200 papers

This document offers a concise introduction to the mathematical theory and practical application of the Hausdorff Measure and Dimension. The primary objective is to clarify and rigorously detail the two most common methods used for…

History and Overview · Mathematics 2025-11-20 Umberto Michelucci

The Johnson-Lindenstrauss transform is a fundamental method for dimension reduction in Euclidean spaces, that can map any dataset of $n$ points into dimension $O(\log n)$ with low distortion of their distances. This dimension bound is tight…

Data Structures and Algorithms · Computer Science 2026-02-20 Shaofeng H. -C. Jiang , Robert Krauthgamer , Shay Sapir , Sandeep Silwal , Di Yue

We prove that the Ahlfors regular conformal dimension is upper semicontinuous with respect to Gromov-Hausdorff convergence when restricted to the class of uniformly perfect, uniformly quasi-selfsimilar metric spaces. Moreover we show the…

Metric Geometry · Mathematics 2023-07-11 Nicola Cavallucci

In this paper we obtain new lower bounds for the upper box dimension of $\alpha\beta$ sets. As a corollary of our main result, we show that if $\alpha$ is not a Liouville number and $\beta$ is a Liouville number, then the upper box…

Dynamical Systems · Mathematics 2021-02-12 Simon Baker

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

Number Theory · Mathematics 2025-08-26 Rachel Greenfeld , Marina Iliopoulou , Sarah Peluse

Let X be a normed space. A subset A of X is approximately convex if $d(ta+(1-t)b,A) \le 1$ for all $a,b \in A$ and $t \in [0,1]$ where $d(x,A)$ is the distance of $x$ to $A$. Let $\Co(A)$ be the convex hull and $\diam(A)$ the diameter of…

Functional Analysis · Mathematics 2007-05-23 S. J. Dilworth , Ralph Howard , James W. Roberts

The Falconer conjecture asserts that if E is a planar set with Hausdorff dimension strictly greater than 1, then its Euclidean distance set has positive one-dimensional Lebesgue measure. We discuss the analogous question with the Euclidean…

Metric Geometry · Mathematics 2007-05-23 Sergei Konyagin , Izabella Laba

Fractal nests are sets defined as unions of unit $n$-spheres scaled by a sequence of $k^{-\alpha}$ for some $\alpha>0$. In this article we generalise the concept to subsets of such spheres and find the formulas for their box counting…

Metric Geometry · Mathematics 2018-08-01 Siniša Miličić

Let $\psi:\mathbb{N} \to [0,\infty)$, $\psi(q)=q^{-(1+\tau)}$ and let $\psi$-badly approximable points be those vectors in $\mathbb{R}^{d}$ that are $\psi$-well approximable, but not $c\psi$-well approximable for arbitrarily small constants…

Number Theory · Mathematics 2023-10-04 Henna Koivusalo , Jason Levesley , Benjamin Ward , Xintian Zhang

We show that a set of small box counting dimension can be covered by a H\"older graph from all but a small set of directions, and give sharp bounds for the dimension of the exceptional set, improving a result of B. Hunt and V. Kaloshin. We…

Classical Analysis and ODEs · Mathematics 2020-10-02 Eino Rossi , Pablo Shmerkin

In this paper we compute the dimension of a class of dynamically defined non-conformal sets. Let $X\subseteq\mathbb{T}^2$ denote a Bedford-McMullen set and $T:X\to X$ the natural expanding toral endomorphism which leaves $X$ invariant. For…

Dynamical Systems · Mathematics 2012-06-12 Andrew Ferguson , Thomas Jordan , Michał Rams

The Hausdorff dimension of the set of simultaneously tau well approximable points lying on a curve defined by a polynomial P(X)+alpha, where P(X) is a polynomial with integer coefficients and alpha is in R, is studied when tau is larger…

Number Theory · Mathematics 2013-05-14 Faustin Adiceam

We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…

Computational Geometry · Computer Science 2014-01-08 Stefan König

This paper concerns the intermediate dimensions, a spectrum of dimensions that interpolate between the Hausdorff and box dimensions. Potential theoretic methods are used to produce dimension bounds for images of sets under H\"older maps and…

Metric Geometry · Mathematics 2021-10-05 Stuart A. Burrell

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

Classical Analysis and ODEs · Mathematics 2017-09-26 Alex Iosevich

We consider four related problems. (1) Obtaining dimension estimates for the set of exceptional vantage points for the pinned Falconer distance problem. (2) Nonlinear projection theorems, in the spirit of Kaufman, Bourgain, and Shmerkin.…

Classical Analysis and ODEs · Mathematics 2024-02-27 Orit E. Raz , Joshua Zahl

Previously, Erd\H{o}s, Kierstead and Trotter investigated the dimension of random height~$2$ partially ordered sets. Their research was motivated primarily by two goals: (1)~analyzing the relative tightness of the F\"{u}redi-Kahn upper…

Combinatorics · Mathematics 2020-03-19 Csaba Biró , Peter Hamburger , H. A. Kierstead , Attila Pór , William T. Trotter , Ruidong Wang

We give a shorter proof of a slightly weaker version of a theorem of Nets Katz and the author. We prove that if a set of $L$ lines in $\mathbb{R}^3$ contains at most $L^{1/2}$ lines in any low degree algebraic surface, then the number of…

Combinatorics · Mathematics 2014-11-12 Larry Guth

Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. In a recent paper Rudnick established asymptotic upper bounds for the minimal gaps of $\{a_n \alpha \bmod 1, 1 \leq n \leq N\}$ as $N \to \infty$, valid for Lebesgue-almost…

Number Theory · Mathematics 2021-08-09 Christoph Aistleitner , Daniel El-Baz , Marc Munsch

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

Computational Geometry · Computer Science 2014-04-25 Quentin Mérigot
‹ Prev 1 8 9 10 Next ›