Related papers: Euclidean Steiner Spanners: Light and Sparse

Let $d$ and $k$ be integers with $1 \leq k \leq d-1$. Let $\Lambda$ be a $d$-dimensional lattice and let $K$ be a $d$-dimensional compact convex body symmetric about the origin. We provide estimates for the minimum number of $k$-dimensional…

We place limits on scalar and vector unparticle couplings to electrons and neutrinos using data from reactor neutrino experiments originally designed to search for neutrino magnetic moment. Upper bounds on Standard Model lepton-scalar…

Let S be a set of n points and let w be a function that assigns non-negative weights to points in S. The additive weighted distance d_w(p, q) between two points p,q belonging to S is defined as w(p) + d(p, q) + w(q) if p \ne q and it is…

I review briefly, primarily for relativists, a series of recent results, obtained with A. Waldron, on the novel behavior of massive higher (s>1) spin systems in constant curvature backgrounds. We find that the cosmological constant Lambda,…

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…

We study spherically symmetric solutions to the Einstein-Euler equations which model an idealized relativistic neutron star surrounded by vacuum. These are barotropic fluids with a free boundary, governed by an equation of state which sets…

Given a connected graph $G=(V,E)$ and a length function $\ell:E\to {\mathbb R}$ we let $d_{v,w}$ denote the shortest distance between vertex $v$ and vertex $w$. A $t$-spanner is a subset $E'\subseteq E$ such that if $d'_{v,w}$ denotes…

A $(1 \pm \epsilon)$-sparsifier of a hypergraph $G(V,E)$ is a (weighted) subgraph that preserves the value of every cut to within a $(1 \pm \epsilon)$-factor. It is known that every hypergraph with $n$ vertices admits a $(1 \pm…

For $\varepsilon\in(0,1/2)$ and a natural number $d\ge 2$, let $N$ be a natural number with \[ N \,\ge\, 2^9\,\log_2(d)\, \left(\frac{\log_2(1/\varepsilon)}{\varepsilon}\right)^2. \] We prove that there is a set of $N$ points in the unit…

We construct new stationary weak solutions of the 3D Euler equation with compact support. The solutions, which are piecewise smooth and discontinuous across a surface, are axisymmetric with swirl. The range of solutions we find is different…

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…

We study configurations of points on the unit sphere that minimize potential energy for a broad class of potential functions (viewed as functions of the squared Euclidean distance between points). Call a configuration sharp if there are m…

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

We are studying $d$-dimensional geometric problems that have algorithms with $1-1/d$ appearing in the exponent of the running time, for example, in the form of $2^{n^{1-1/d}}$ or $n^{k^{1-1/d}}$. This means that these algorithms perform…

We study the min-max optimization problem where each function contributing to the max operation is strongly-convex and smooth with bounded gradient in the search domain. By smoothing the max operator, we show the ability to achieve an…

This paper investigates the existence and properties of stable, uniformly rotating star-planet systems, i.e. mass ratio is sufficiently small. It is modeled by the Euler-Poisson equations. Following the framework established by McCann for…

In a very interesting paper, Cunha, Berti, and Herdeiro have recently claimed that ultra-compact objects, self-gravitating horizonless solutions of the Einstein field equations which have a light ring, must possess at least {\it two} (and,…

We consider a minimal natural supersymmetric model based on an extra dimension with supersymmetry breaking provided by the Scherk-Schwarz mechanism. The lightest supersymmetric particle is a neutral, quasi-Dirac Higgsino and, unlike in…

The Gilbert-Pollak Conjecture \citep{gilbert1968steiner}, also known as the Steiner Ratio Conjecture, states that for any finite point set in the Euclidean plane, the Steiner minimum tree has length at least $\sqrt{3}/2 \approx 0.866$ times…

We prove better lower bounds on additive spanners and emulators, which are lossy compression schemes for undirected graphs, as well as lower bounds on shortcut sets, which reduce the diameter of directed graphs. We show that any $O(n)$-size…