Related papers: Light Euclidean Spanners with Steiner Points

Here we show that Lerner's method of local mean oscillation gives a simple proof of the $A_2$ conjecture for spaces of homogeneous type: that is, the linear dependence on the $A_2$ norm for weighted $L^2$ Calderon-Zygmund operator…

We study the oracle complexity of finding $\varepsilon$-Pareto stationary points in smooth multiobjective optimization with $m$ objectives. Progress is measured by the Pareto stationarity gap $\mathcal{G}(x)$, the norm of the best convex…

Itsykson and Sokolov [IS14] identified resolution over parities, denoted by $\text{Res}(\oplus)$, as a natural and simple fragment of $\text{AC}^0[2]$-Frege for which no super-polynomial lower bounds on size of proofs are known. Building on…

The Cheeger constant of an open set of the Euclidean space is defined by minimizing the ratio "perimeter over volume", among all its smooth compactly contained subsets. We consider a natural variant of this problem, where the volume of…

Consider an n-point metric M = (V,delta), and a transmission range assignment r: V \rightarrow \mathbb R^+ that maps each point v in V to the disk of radius r(v) around it. The {symmetric disk graph} (henceforth, SDG) that corresponds to M…

We examine directed spanners through flow-based linear programming relaxations. We design an $\~O(n^{2/3})$-approximation algorithm for the directed $k$-spanner problem that works for all $k\geq 1$, which is the first sublinear…

We show that for large enough $n$, the number of non-isomorphic pseudoline arrangements of order $n$ is greater than $2^{c\cdot n^2}$ for some constant $c > 0.2604$, improving the previous best bound of $c>0.2083$ by Dumitrescu and Mandal…

We prove a gravitational lensing theorem: the magnification of a source of uniform brightness by a foreground spherical lens is mu =1+pi(2R_E^2-R_L^2)/A, where A is the area of the source and R_E and R_L are the Einstein radius and size of…

A graph spanner is a fundamental graph structure that faithfully preserves the pairwise distances in the input graph up to a small multiplicative stretch. The common objective in the computation of spanners is to achieve the best-known…

We derive a class of discrete nonlinear Schr{\"o}dinger (DNLS) equations for general polynomial nonlinearity whose stationary solutions can be found from a reduced two-point algebraic problem. It is demonstrated that the derived class of…

For $0\le k\le n$, write $\binom nk=uv$ where the primes dividing $u$ are at most $k$ and the primes dividing $v$ exceed $k$, and let $f(n)$ be the least $k$ with $u>n^2$; Erd\H{o}s problem 684 asks for bounds on $f(n)$. We resolve the…

We develop strong lower bounds for the span of the projective Stiefel manifolds $X_{n,r}=O(n)/(O(n-r)\times \mathbb Z/2)$, which enable very accurate (in many cases exact) estimates of the span. The technique, for the most part, involves…

While research on the geometry of planar graphs has been active in the past decades, many properties of planar metrics remain mysterious. This paper studies a fundamental aspect of the planar graph geometry: covering planar metrics by a…

The metric sketching problem is defined as follows. Given a metric on $n$ points, and $\epsilon>0$, we wish to produce a small size data structure (sketch) that, given any pair of point indices, recovers the distance between the points up…

Consider a set $P$ of $n$ points in $\mathbb{R}^d$. In the discrete median line segment problem, the objective is to find a line segment bounded by a pair of points in $P$ such that the sum of the Euclidean distances from $P$ to the line…

The existence of Steiner triple systems STS(n) of order n containing no nontrivial subsystem is well known for every admissible n. We generalize this result in two ways. First we define the expander property of 3-uniform hypergraphs and…

We study the mixed dispersion fourth order nonlinear Schr\"odinger equation \begin{equation*} %\tag{\protect{4NLS}}\label{4nls} i \partial_t \psi -\gamma \Delta^2 \psi +\beta \Delta \psi +|\psi|^{2\sigma} \psi =0\ \text{in}\ \R \times\R^N,…

Let $S = \{ {A_1},{A_2}, \cdots ,{A_n}\} $ be a finite point set in m-dimensional Euclidean space ${E^m}$, and$\left\| {{A_i}{A_j}} \right\|$ be the distance between $A_i$ and $A_j$. Define $\sigma (S) = \sum\limits_{1 \le i < j \le n}…

This paper is concerned with a threshold phenomenon for the existence of scattering states for nonlinear Schr\"odinger equations. The nonlinearity includes a non-oscillatory term of the order lower than the Strauss exponent. We show that no…

We provide new algorithms and conditional hardness for the problem of estimating effective resistances in $n$-node $m$-edge undirected, expander graphs. We provide an $\widetilde{O}(m\epsilon^{-1})$-time algorithm that produces with high…