Related papers: Maximal equilateral sets
We use the measurable Hall's theorem due to Cie\'sla and Sabok to prove that (i) if two measurable sets $A,B \subset \mathbb{R}^d$ of the same measure are bounded remainder sets with respect to a given irrational $d$-dimensional vector…
For point $x$ in the inverse limit space $X$ with a single unimodal bonding map we construct, with the use of symbolic dynamics, a planar embedding such that $x$ is accessible. It follows that there are uncountably many non-equivalent…
Let $M^n$ be an $n$-dimensional Riemannian manifold with boundary $\partial M$. Assume that Ricci curvature is bounded from below by $(n-1)k$, for $k\in \RR$, we give a sharp estimate of the upper bound of $\rho(x)=\dis(x, \partial M)$, in…
Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…
The classical Ramsey theorem, states that every graph contains either a large clique or a large independent set. Here we investigate similar dichotomic phenomena in the context of finite metric spaces. Namely, we prove statements of the…
A finite set of distinct vectors $\mathcal{X}$ in the $d$-dimensional Euclidean space $\mathbb{R}^d$ is called an $s$-distance set if the set of mutual distances between distinct elements of $\mathcal{X}$ has cardinality $s$. In this paper…
In this paper, we extend the theory of simultaneous Diophantine approximation to infinite dimensions. Moreover, we discuss Dirichlet-type theorems in a very general framework and define what it means for such a theorem to be optimal. We…
In this paper, claims by Lemmens and Seidel in 1973 about equiangular sets of lines with angle $1/5$ are proved by carefully analyzing pillar decompositions, with the aid of the uniqueness of two-graphs on $276$ vertices. The Neumann…
Let $L_N = L_{MBM}(X_1,..., X_N; Y_1,..., Y_N)$ be the minimum length of a bipartite matching between two sets of points in $\mathbf{R}^d$, where $X_1,..., X_N,...$ and $Y_1,..., Y_N,...$ are random points independently and uniformly…
Here are two of our main results: Theorem 1. Let X be a normal space with dim X=n and m\geq n+1. Then the space C*(X,R^m) of all bounded maps from X into R^m equipped with the uniform convergence topology contains a dense G_{\delta}-subset…
The celebrated Johnson-Lindenstrauss lemma states that for all $\varepsilon \in (0,1)$ and finite sets $X \subseteq \mathbb{R}^N$ with $n>1$ elements, there exists a matrix $\Phi \in \mathbb{R}^{m \times N}$ with…
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…
Let $(X,\S)$ be a set system on an $n$-point set $X$. The \emph{discrepancy} of $\S$ is defined as the minimum of the largest deviation from an even split, over all subsets of $S \in \S$ and two-colorings $\chi$ on $X$. We consider the…
For a bounded metric space $ X $ one can consider the quantity $ \delta(X) := \text{inf\rule[-0.5ex]{0em}{1ex}}_{\,p\in X}\; \text{sup}_{q \in X} \; d(p,q) $. This purely metric invariant is known from approximation theory as the relative…
Let $A$ and $X$ be nonempty, bounded and closed subsets of a geodesic metric space $(E,d)$. The minimization (resp. maximization) problem denoted by $\min(A,X)$ (resp. $\max(A,X)$) consists in finding $(a_0,x_0) \in A \times X$ such that…
For any metric space $X$, finite subset spaces of $X$ provide a sequence of isometric embeddings $X=X(1)\subset X(2)\subset\cdots$. The existence of Lipschitz retractions $r_n\colon X(n)\to X(n-1)$ depends on the geometry of $X$ in a subtle…
Suppose a finite group $G$ acts on a manifold $M$. By a theorem of Mostow, also Palais, there is a $G$-equivariant embedding of $M$ into the $m$-dimensional Euclidean space $\RR^{m}$ for some $m$. We are interested in some explicit bounds…
R. B. Kusner [R. Guy, Amer. Math. Monthly 90 (1983), 196--199] asked whether a set of vectors in a d-dimensional real vector space such that the l-p distance between any pair is 1, has cardinality at most d+1. We show that this is true for…
For any $i,j \ge 0$ with $i+j =1$, let $\bad(i,j)$ denote the set of points $(x,y) \in \R^2$ for which $ \max \{\|qx\|^{1/i}, \|qy\|^{1/j} \} > c/q $ for all $ q \in \N $. Here $c = c(x,y)$ is a positive constant. Our main result implies…
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.…