Related papers: A note on the distinct distances problem over fini…
Metric embeddings are central to metric theory and its applications. Here we consider embeddings of a different sort: maps from a set to subsets of a metric space so that distances between points are approximated by minimal distances…
We obtain a exponential large deviation upper bound for continuous observables on suspension semiflows over a non-uniformly expanding base transformation with non-flat singularities and/or discontinuities, where the roof function defining…
We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…
We improve the Peres-Schlag result on pinned distances in sets of a given Hausdorff dimension. In particular, for Euclidean distances, with $$\Delta^y(E) = \{|x-y|:x\in E\},$$ we prove that for any $E, F\subset{\Bbb R}^d$, there exists a…
We study the problem of how well a tree metric is able to preserve the sum of pairwise distances of an arbitrary metric. This problem is closely related to low-stretch metric embeddings and is interesting by its own flavor from the line of…
We study a matrix analog of the Erd\H{o}s-Falconer distance problems in vector spaces over finite fields. There arises an interesting analysis of certain quadratic matrix Gauss sums.
We establish a family of uncertainty principles for finite linear combinations of Hermite functions. More precisely, we give a geometric criterion on a subset $S\subset \RR^d$ ensuring that the $L^2$-seminorm associated to $S$ is equivalent…
The Fermat-Steiner problem consists in finding all points in a metric space $Y$ such that the sum of distances from each of them to the points from some fixed finite subset of $Y$ is minimal. This problem is investigated for the metric…
A $(k,m)$-Furstenberg set is a subset $S \subset \mathbb{F}_q^n$ with the property that each $k$-dimensional subspace of $\mathbb{F}_q^n$ can be translated so that it intersects $S$ in at least $m$ points. Ellenberg and Erman proved that…
An edge-colored graph is said to be rainbow if all its edges have distinct colors. In this paper, we study the rainbow analogue of a fundamental result of Mader [\emph{Math. Ann.} \textbf{174} (1967), 265--268] on the existence of…
Let $\mathbb{F}_q$ be a finite field of order $q$ and $\mathcal{E}$ be a set in $\mathbb{F}_q^d$. The distance set of $\mathcal{E}$, denoted by $\Delta(\mathcal{E})$, is the set of distinct distances determined by the pairs of points in…
The homogeneous metric can be viewed as a natural extension of the Hamming metric to finite chain rings. It distinguishes between three types of elements: zero, non-zero elements in the socle, and elements outside the socle. Since the…
Let $\left\{a_1, \dots, a_n\right\} \subset \mathbb{N}$ be a set of positive integers, $a_n$ denoting the largest element, so that for any two of the $2^n$ subsets the sum of all elements is distinct. Erd\H{o}s asked whether this implies…
Rank-constrained matrix problems appear frequently across science and engineering. The convergence analysis of iterative algorithms developed for these problems often hinges on local error bounds, which correlate the distance to the…
Numerous problems consisting in identifying vertices in graphs using distances are useful in domains such as network verification and graph isomorphism. Unifying them into a meta-problem may be of main interest. We introduce here a…
A collection of $k$ sets is said to form a $k$-sunflower, or $\Delta$-system, if the intersection of any two sets from the collection is the same, and we call a family of sets $\mathcal{F}$ sunflower-free if it contains no sunflowers.…
Graham and Winkler derived a formula for the determinant of the distance matrix of a full-dimensional set of $n + 1$ points $\{ x_{0}, x_{1}, \ldots , x_{n} \}$ in the Hamming cube $H_{n} = ( \{ 0,1 \}^{n}, \ell_{1} )$. In this article we…
We endow the set of persistence diagrams with the strong topology (the topology of countable direct limit of increasing sequence of bounded subsets considered in the bottleneck distance). The topology of the obtained space is described.…
Let $V$ denote an $r$-dimensional $\mathbb{F}_{q^n}$-vector space. For an $m$-dimensional $\mathbb{F}_q$-subspace $U$ of $V$ assume that $\dim_q \left(\langle {\bf v}\rangle_{\mathbb{F}_{q^n}} \cap U\right) \geq 2$ for each non zero vector…
We construct a set of $2^n$ points in $\mathbb{R}^n$ such that all pairwise Manhattan distances are odd integers, which improves the recent linear lower bound of Golovanov, Kupavskii and Sagdeev. In contrast to the Euclidean and maximum…