Related papers: On necklaces inside thin subsets of ${\Bbb R}^d$
Suppose $k\nmid n$ and $H$ is an $n$-vertex $k$-uniform hypergraph. A near perfect matching in $H$ is a matching of size $\lfloor n/k\rfloor$. We give a divisibility barrier construction that prevents the existence of near perfect matchings…
For any two configurations of ordered points $p=(p_{1},...,\p_{N})$ and $q=(q_{1},...,q_{N})$ in Euclidean space $E^d$ such that $q$ is an expansion of $p$, there exists a continuous expansion from $p$ to $q$ in dimension 2d; Bezdek and…
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…
In this paper we extend the works of Tancer and of Malgouyres and Franc\'es, showing that $(d,k)$-collapsibility is NP-complete for $d\geq k+2$ except $(2,0)$. By $(d,k)$-collapsibility we mean the following problem: determine whether a…
For every e>0, any subset of R^n with Hausdorff dimension larger than (1-e)n must have ultrametric distortion larger than 1/(4e).
Let $Q_d$ be the hypercube of dimension $d$ and let $H$ and $K$ be subsets of the vertex set $V(Q_d)$, called configurations in $Q_d$. We say that $K$ is an \emph{exact copy} of $H$ if there is an automorphism of $Q_d$ which sends $H$ onto…
In this paper we obtain the rates of convergence of the algorithms given in [13] and [14] for an automatic computation of the centered Hausdorff and packing measures of a totally disconnected self-similar set. We evaluate these rates…
R\"odl, Ruci\'nski, and Szemer\'edi determined the minimum $(k-1)$-degree threshold for the existence of fractional perfect matchings in $k$-uniform hypergrahs, and K\"uhn, Osthus, and Townsend extended this result by asymptotically…
The structure of $k$-diametral point configurations in Minkowski $d$-space is shown to be closely related to the properties of $k$-antipodal point configurations in $\mathbb{R}^d$. In particular, the maximum size of $k$-diametral point…
Motivated by the problem of dealing with incomplete or imprecise acquisition of data in computer vision and computer graphics, we extend results concerning the stability of persistent homology with respect to function perturbations to…
In this paper, we study the cardinality of the distance set $\Delta(A, B)$ determined by two subsets $A$ and $B$ of the $d$-dimensional vector space over a finite field $\mathbb{F}_q$. Assuming that $A$ or $B$ lies in a $k$-coordinate plane…
We establish a connection between gaps problems in Diophantine approximation and the frequency spectrum of patches in cut and project sets with special windows. Our theorems provide bounds for the number of distinct frequencies of patches…
We prove a structure theorem for any $n$-rectifiable set $E\subset \mathbb{R}^{n+1}$, $n\ge 1$, satisfying a weak version of the lower ADR condition, and having locally finite $H^n$ ($n$-dimensional Hausdorff) measure. Namely, that…
For integers $d \geq 2$ and $k \geq d+1$, a $k$-hole in a set $S$ of points in general position in $\mathbb{R}^d$ is a $k$-tuple of points from $S$ in convex position such that the interior of their convex hull does not contain any point…
It is known that any open necklace with beads of $t$ types in which the number of beads of each type is divisible by $k$, can be partitioned by at most $(k-1)t$ cuts into intervals that can be distributed into $k$ collections, each…
For $d\ge 1$, we construct a compact subset $K\subseteq \mathbb {R}^{d+1}$ containing a $d$-sphere of every radius between $1$ and $2$, such that for every $\delta\in (0,1)$, the $\delta$-neighbourhood of $K$ has Lebesgue measure $\lesssim…
The Euclidean black hole has topology $\Re^2 \times {\cal S}^{d-2}$. It is shown that -in Einstein's theory- the deficit angle of a cusp at any point in $\Re^2$ and the area of the ${\cal S}^{d-2}$ are canonical conjugates. The black hole…
A symmetric subset of the reals is one that remains invariant under some reflection x --> c-x. Given 0 < x < 1, there exists a real number D(x) with the following property: if 0 < d < D(x), then every subset of [0,1] with measure x contains…
We study the relationship between the sizes of two sets $B, S\subset\mathbb{R}^2$ when $B$ contains either the whole boundary, or the four vertices, of a square with axes-parallel sides and center in every point of $S$, where size refers to…
We analytically explore the scaling properties of a general class of nested subgraphs in complex networks, which includes the $K$-core and the $K$-scaffold, among others. We name such class of subgraphs $K$-nested subgraphs due to the fact…