Related papers: Optimal terminal dimensionality reduction in Eucli…

A theorem of Glasner says that if $X$ is an infinite subset of the torus $\mathbb{T}$, then for any $\epsilon>0$, there exists an integer $n$ such that the dilation $nX=\{nx: x \in \mathbb{T} \}$ is $\epsilon$-dense (i.e, it intersects any…

Let $(M,g)$ be a smooth compact Riemannian manifold of dimension $n$ with smooth boundary $\partial M$, admitting a scalar-flat conformal metric. We prove that the supremum of the isoperimetric ratio over the scalar-flat conformal class is…

Optimal transport from the volume measure to a convex combination of Dirac measures yields a tessellation of a Riemannian manifold into pieces of arbitrary relative size. This tessellation is studied for the cost functions…

We demonstrate that for expander graphs, for all $\epsilon > 0,$ there exists a data structure of size $\widetilde{O}(n\epsilon^{-1})$ which can be used to return $(1 + \epsilon)$-approximations to effective resistances in…

We consider the problem of encoding a set of vectors into a minimal number of bits while preserving information on their Euclidean geometry. We show that this task can be accomplished by applying a Johnson-Lindenstrauss embedding and…

The problem of finding \emph{distance} between \emph{pattern} of length $m$ and \emph{text} of length $n$ is a typical way of generalizing pattern matching to incorporate dissimilarity score. For both Hamming and $L_1$ distances only a…

For positive integers $n$ and $m$, consider a multiset of non-empty subsets of $[m]$ such that there is a \textit{unique} partition of these subsets into $n$ partitions of $[m]$. We study the maximum possible size $g(n,m)$ of such a…

We will prove that for every $m\geq 0$ there exists an $\varepsilon=\varepsilon(m)>0$ such that if $0<\lambda<\varepsilon$ and $x$ is sufficiently large in terms of $m$ and $\lambda$, then $$|\lbrace n\leq x: |[n,n+\lambda\log n]\cap…

Let $\mathcal{M}(n,D)$ be the space of closed $n$-dimensional Riemannian manifolds $(M,g)$ with $diam(M) \leq D$ and $| \sec^M | \leq 1$. In this paper we consider sequences $(M_i,g_i)$ in $\mathcal{M}(n,D)$ converging in the…

We show that $C(X)$ admits an equivalent pointwise lower semicontinuous locally uniformly rotund norm provided $X$ is Fedorchuk compact of spectral height 3. In other words $X$ admits a fully closed map $f$ onto a metric compact $Y$ such…

The Lipschitz extension modulus $e(M)$ of a metric space $M$ is the infimum over $L\ge 1$ such that for any Banach space $Z$ and any $C\subset M$, any 1-Lipschitz function $f:C\to Z$ can be extended to an $L$-Lipschitz function $F:M\to Z$.…

Let $X$ be a metric space with doubling measure, and $L$ be a nonnegative self-adjoint operator on $L^2(X)$ whose heat kernel satisfies the Gaussian upper bound. Let $f$ be in the space $ {\rm BMO}_L(X)$ associated with the operator $L$ and…

In seminal work, Lov\'asz, Spencer, and Vesztergombi [European J. Combin., 1986] proved a lower bound for the hereditary discrepancy of a matrix $A \in \mathbb{R}^{m \times n}$ in terms of the maximum $|\det(B)|^{1/k}$ over all $k \times k$…

Let $M$ and $N$ be two closed hyperbolic Riemann surfaces. The Ehrenpreis Conjecture (proved by Kahn-Markovic) asserts that for any $\epsilon>0$ there are finite covers $M_\epsilon \to M$, and $N_\epsilon \to N$, such that the Teichmuller…

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…

We partly extend the localisation technique from convex geometry to the multiple constraints setting. For a given $1$-Lipschitz map $u\colon\mathbb{R}^n\to\mathbb{R}^m$, $m\leq n$, we define and prove the existence of a partition of…

Let $\mathcal{M}$ be a smooth submanifold of $\mathbb{R}^n$ equipped with the Euclidean (chordal) metric. This note considers the smallest dimension $m$ for which there exists a bi-Lipschitz function $f: \mathcal{M} \mapsto \mathbb{R}^m$…

For a polynomial $f(x)\in \mathbb Z[x]$ we study an analogue of Jacobsthal function, defined by the formula \[ j_f(N)=\max_{m}\{\text{For some } x\in \mathbb N \text{ the inequality } (x+f(i),N)>1 \text{ holds for all }i\leq m\}. \] We…

This paper deals with a variant of the optimal transportation problem. Given f $\in$ L 1 (R d , [0, 1]) and a cost function c $\in$ C(R d x R d) of the form c(x, y) = k(y -- x), we minimise $\int$ c d$\gamma$ among transport plans $\gamma$…

An oblivious subspace embedding (OSE), characterized by parameters $m,n,d,\epsilon,\delta$, is a random matrix $\Pi\in \mathbb{R}^{m\times n}$ such that for any $d$-dimensional subspace $T\subseteq \mathbb{R}^n$, $\Pr_\Pi[\forall x\in T,…