Related papers: Light spanners for snowflake metrics
We investigate the dispersive properties of solutions to the Schr\"odinger equation with a weakly decaying radial potential on cones. If the potential has sufficient polynomial decay at infinity, then we show that the Schr\"odinger flow on…
Given an arbitrary set of high dimensional points in $\ell_1$, there are known negative results that preclude the possibility of always mapping them to a low dimensional $\ell_1$ space while preserving distances with small multiplicative…
The depinning of an elastic line interacting with a quenched disorder is studied for long range interactions, applicable to crack propagation or wetting. An ultrametric distance is introduced instead of the Euclidean distance, allowing for…
Let $g$ be a Riemannian metric for $\mathbf{R}^d$ ($d\geq 3$) which differs from the Euclidean metric only in a smooth and strictly convex bounded domain $M$. The lens rigidity problem is concerned with recovering the metric $g$ inside $M$…
This author's recent proposal of interferometric tests of Planck-scale-related properties of space-time is here revisited from a strictly phenomenological viewpoint. The results announced previously are rederived using elementary…
Let $|\cdot|$ be the standard Euclidean norm on $\mathbb{R}^n$ and let $X=(\mathbb{R}^n,\|\cdot\|)$ be a normed space. A subspace $Y\subset X$ is \emph{strongly $\alpha$-Euclidean} if there is a constant $t$ such that…
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…
We establish Strichartz estimates for the Schr\"odinger equation on Riemannian manifolds $(\Omega,\g)$ with boundary, for both the compact case and the case that $\Omega$ is the exterior of a smooth, non-trapping obstacle in Euclidean…
$\newcommand{\Re}{\mathbb{R}}$We study the minWSPD problem of computing the minimum-size well-separated pairs decomposition of a set of points, and show constant approximation algorithms in low-dimensional Euclidean space and doubling…
Consider an undirected weighted graph G=(V,E) with |V|=n and |E|=m, where each vertex v is assigned a label from a set L of \ell labels. We show how to construct a compact distance oracle that can answer queries of the form: "what is the…
Finsler spacetimes have become increasingly popular within the theoretical physics community over the last two decades. Because physicists need to use pseudo-Finsler structures to describe propagation}of signals, there will be nonzero null…
In this paper we construct a new family of sets based on Diophantine approximation in the Euclidean space, and consider their applications in several problems in harmonic analysis. Our first application is on the Hausdorff dimension of our…
Given two compact n-dimensional manifolds in the smooth, piecewise linear or topological categories, basic results of B. Mazur and others give simple criteria for determining whether their products with Euclidean spaces of sufficiently…
We investigate the holonomy group of a linear metric connection with skew-symmetric torsion. In case of the euclidian space and a constant torsion form this group is always semisimple. It does not preserve any non-degenerated 2-form or any…
In this paper, we solve the fractional anisotropic Calder\'on problem with external data in the Euclidean space, in dimensions two and higher, for smooth Riemannian metrics that agree with the Euclidean metric outside a compact set.…
It has been shown that space-time coordinates can exhibit only very few types of short-distance structures, if described by linear operators: they can be continuous, discrete or "unsharp" in one of two ways. In the literature, various…
Spaceplates are novel flat-optic devices that implement the optical response of a free-space volume over a smaller length, effectively "compressing space" for light propagation. Together with flat lenses such as metalenses or diffractive…
We present a new approach to approximate nearest-neighbor queries in fixed dimension under a variety of non-Euclidean distances. We are given a set $S$ of $n$ points in $\mathbb{R}^d$, an approximation parameter $\varepsilon > 0$, and a…
Recent literature has shown that symbolic data, such as text and graphs, is often better represented by points on a curved manifold, rather than in Euclidean space. However, geometrical operations on manifolds are generally more complicated…
The unit disk graph (UDG) is a widely employed model for the study of wireless networks. In this model, wireless nodes are represented by points in the plane and there is an edge between two points if and only if their Euclidean distance is…