English
Related papers

Related papers: On necklaces inside thin subsets of ${\Bbb R}^d$

200 papers

We characterize the existence of certain geometric configurations in the fractal percolation limit set $A$ in terms of the almost sure dimension of $A$. Some examples of the configurations we study are: homothetic copies of finite sets,…

Probability · Mathematics 2017-03-29 Pablo Shmerkin , Ville Suomala

The self-closeness number $N\mathcal{E}(X)$ of a space $X$ is the least integer $k$ such that any self-map is a homotopy equivalence whenever it is an isomorphism in the $n$-th homotopy group for each $n\le k$. We discuss the self-closeness…

Algebraic Topology · Mathematics 2021-07-16 Yichen Tong

For any tangle $T$ (up to isotopy) and integer $k\geq 1$ we construct a group $F(T)$ (up to isomorphism). It is the fundamental group of the configuration space of $k$ points in a horizontal plane avoiding the tangle, provided the tangle is…

Geometric Topology · Mathematics 2007-05-23 Daan Krammer

We study a variant of the Erd\H os unit distance problem, concerning angles between successive triples of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, and a sequence of angles…

Combinatorics · Mathematics 2021-04-21 Eyvindur Ari Palsson , Steven Senger , Charles Wolf

This article focuses on the occurrence of 3-point configurations in subsets of $\mathbb{R}^d$ of sufficient thickness. We prove that a compact set $A\subset \mathbb{R}^d$ contains a similar copy of any linear $3$-point configuration (such…

Classical Analysis and ODEs · Mathematics 2026-03-09 Samantha Sandberg-Clark , Krystal Taylor

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

Combinatorics · Mathematics 2010-04-13 Adrian Dumitrescu

One of the main problems of subspace coding asks for the maximum possible cardinality of a subspace code with minimum distance at least $d$ over $\mathbb{F}_q^n$, where the dimensions of the codewords, which are vector spaces, are contained…

Combinatorics · Mathematics 2019-12-24 Daniel Heinlein , Michael Kiermaier , Sascha Kurz , Alfred Wassermann

We compute the Hausdorff dimension of the set of simultaneously $q^{-\lambda}$-well approximable points on the Veronese curve in $\mathbb{R}^n$ for $\lambda$ between $\frac{1}{n}$ and $\frac{2}{2n-1}$. For $n=3$, the same result is given…

Number Theory · Mathematics 2025-03-14 Dzmitry Badziahin

Network Embeddings (NEs) map the nodes of a given network into $d$-dimensional Euclidean space $\mathbb{R}^d$. Ideally, this mapping is such that `similar' nodes are mapped onto nearby points, such that the NE can be used for purposes such…

Machine Learning · Statistics 2018-10-17 Bo Kang , Jefrey Lijffijt , Tijl De Bie

The Gromov-Hausdorff distance $(d_{GH})$ proves to be a useful distance measure between shapes. In order to approximate $d_{GH}$ for compact subsets $X,Y\subset\mathbb{R}^d$, we look into its relationship with $d_{H,iso}$, the infimum…

Metric Geometry · Mathematics 2024-05-28 Sushovan Majhi , Jeffrey Vitter , Carola Wenk

We prove that the set of $n$-point configurations for which the solution of the planar Steiner problem is not unique has the Hausdorff dimension at most $2n-1$ (as a subset of $\mathbb{R}^{2n}$). Moreover, we show that the Hausdorff…

Metric Geometry · Mathematics 2023-03-22 Mikhail Basok , Danila Cherkashin , Nikita Rastegaev , Yana Teplitskaya

We study a variant of the Falconer distance problem for dot products. In particular, for fractal subsets $A\subset \mathbb{R}^n$ and $a,x\in \mathbb{R}^n$, we study sets of the form \[ \Pi_x^a(A) := \{\alpha \in \mathbb{R} : (a-x)\cdot y=…

Classical Analysis and ODEs · Mathematics 2024-12-25 Paige Bright , Caleb Marshall , Steven Senger

In this paper we classify the homotopy classes of proper maps $E\rightarrow \mathbb R^k$, where $E$ is a vector bundle over a compact Hausdorff space. As a corollary we compute the homotopy classes of proper maps $\mathbb R^n\rightarrow…

Algebraic Topology · Mathematics 2019-03-11 Thomas O. Rot

Let $\ell_1,\ell_2,\dots$ be a countable collection of lines in ${\mathbb R}^d$. For any $t \in [0,1]$ we construct a compact set $\Gamma\subset{\mathbb R}^d$ with Hausdorff dimension $d-1+t$ which projects injectively into each $\ell_i$,…

Metric Geometry · Mathematics 2021-08-25 Frank Coen , Nate Gillman , Tamás Keleti , Dylan King , Jennifer Zhu

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

Denote by E(Y) the group of homotopy classes of self-homotopy equivalences of a finite-dimensional complex Y. We give a selection of results about certain subgroups of E(Y). We establish a connection between the Gottlieb groups of Y and the…

Algebraic Topology · Mathematics 2007-05-23 M. Arkowitz , G. Lupton , A. Murillo

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

Combinatorics · Mathematics 2024-03-14 Dmitrii Zakharov

For static fluid interiors of compact objects in pure Lovelock gravity (involving ony one $N$th order term in the equation) we establish similarity in solutions for the critical odd and even $d=2N+1, 2N+2$ dimensions. It turns out that in…

General Relativity and Quantum Cosmology · Physics 2017-06-07 Naresh Dadhich , Sudan Hansraj , Brian Chilambwe

The construction of $r$-nets offers a powerful tool in computational and metric geometry. We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computes approximate $r$-nets with respect to Euclidean…

Computational Geometry · Computer Science 2017-05-09 Georgia Avarikioti , Ioannis Z. Emiris , Loukas Kavouras , Ioannis Psarros

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