English
Related papers

Related papers: On Nearly Optimal Paper Moebius Bands

200 papers

In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…

Metric Geometry · Mathematics 2013-12-10 Zakhar Ovsyannikov

We prove that in every metric space where no line contains all the points, there are at least $\Omega(n^{2/3})$ lines. This improves the previous $\Omega(\sqrt{n})$ lower bound on the number of lines in general metric space, and also…

Combinatorics · Mathematics 2024-12-10 Congkai Huang

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…

Computational Geometry · Computer Science 2016-11-30 Piotr Indyk , Tal Wagner

Let $M$ be a smooth, compact, connected, oriented Riemannian manifold, and let $\imath: M \to \mathbb R^d$ be an isometric embedding. We show that a Sobolev map $f: M \to M$ which has the property that the differential $df(q)$ is close to…

Analysis of PDEs · Mathematics 2024-02-12 Sergio Conti , Georg Dolzmann , Stefan Müller

Let $\Omega\subset \mathbb{R}^n$ be non-empty, open and proper. Consider $Wb(\Omega)$, the space of finite Borel measures on $\Omega$ equipped with the partial transportation metric introduced by Figalli and Gigli that allows the creation…

Metric Geometry · Mathematics 2024-02-21 David Bate , Ana Lucia Garcia-Pulido

Our work investigates varifolds $\Sigma \subset M$ in a Riemannian manifold, with arbitrary codimension and bounded mean curvature, contained in an open domain $\Omega$. Under mild assumptions on the curvatures of $M$ and on $\partial…

Differential Geometry · Mathematics 2024-01-17 Eddygledson Souza Gama , Jorge H. S. de Lira , Luciano Mari , Adriano A. de Medeiros

We show if M is a closed, connected, orientable, hyperbolic 3-manifold with Heegaard genus g then g >= 1/2 cosh(r) where r denotes the radius of any isometrically embedded ball in M. Assuming an unpublished result of Pitts and Rubinstein…

Geometric Topology · Mathematics 2014-10-01 David Bachman , Daryl Cooper , Matthew E. White

Let $\mathcal{P}$ be a set of $n$ points in the Euclidean plane. We prove that, for any $\epsilon > 0$, either a single line or circle contains $n/2$ points of $\mathcal{P}$, or the number of distinct perpendicular bisectors determined by…

Combinatorics · Mathematics 2019-03-06 Ben Lund

Let $\Omega$ be a measurable Euclidean set in $\mathbb{R}^{n}$ that is symmetric, i.e. $\Omega=-\Omega$, such that $\Omega\times\mathbb{R}$ has the smallest Gaussian surface area among all measurable symmetric sets of fixed Gaussian volume.…

Probability · Mathematics 2022-04-27 Steven Heilman

Let $M$ be a closed Riemannian manifold and let $X\subseteq M$. If the sample $X$ is sufficiently dense relative to the curvature of $M$, then the Gromov-Hausdorff distance between $X$ and $M$ is bounded from below by half their Hausdorff…

Metric Geometry · Mathematics 2025-02-13 Henry Adams , Florian Frick , Sushovan Majhi , Nicholas McBride

Wintgen ideal submanifolds in space forms are those ones attaining equality at every point in the so-called DDVV inequality which relates the scalar curvature, the mean curvature and the normal scalar curvature. This property is conformal…

Differential Geometry · Mathematics 2015-06-18 Zhenxiao Xie , Tongzhu Li , Xiang Ma , Changping Wang

In a graph $A$, the measure $|M_g^A(f)|=m_g^A(f)$ for each arbitrary edge $f=gh$ counts the edges in $A$ closer to $g$ than $h$. $A$ is termed an edge quasi-$\lambda$-distance-balanced graph in a metric space (abbreviated as $EQDBG$), where…

Combinatorics · Mathematics 2024-06-19 Zohreh Aliannejadi , Somayeh Shafiee Alamoti

We extend a recent result of Avelin, Hed, and Persson about approximation of functions $u$ that are plurisubharmonic on a domain $\Omega$ and continuous on $\bar\Omega$, with functions that are plurisubharmonic on (shrinking) neighborhoods…

Complex Variables · Mathematics 2016-09-16 Haakan Persson , Jan Wiegerinck

We show, assuming the Strong Exponential Time Hypothesis, that for every $\varepsilon > 0$, approximating directed Diameter on $m$-arc graphs within ratio $7/4 - \varepsilon$ requires $m^{4/3 - o(1)}$ time. Our construction uses nonnegative…

Data Structures and Algorithms · Computer Science 2021-02-09 Édouard Bonnet

Suppose $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^2$ is a set of $n$ points in the plane with diameter $\leq 1$, meaning $|x_i - x_j| \leq 1$ for all $1 \leq i,j \leq n$. We show that the ratio of the number of ``neighbors''…

Combinatorics · Mathematics 2026-05-19 Samuel Korsky

It is shown that the optical properties of an irregular porous grain with effective radius $a_{\rm eff}\lesssim 3\lambda$ (where $\lambda$ is the wavelength) can be well approximated by a ``spheroidal analog'': a spheroid with appropriate…

Astrophysics of Galaxies · Physics 2025-05-15 B. T. Draine

We consider the orthogonality graph Omega(n) with 2^n vertices corresponding to the 0-1 n-vectors, two vertices adjacent if and only if the Hamming distance between them is n/2. We show that the stability number of Omega(16) is…

Combinatorics · Mathematics 2009-09-29 E. de Klerk , D. V. Pasechnik

The circumference of a graph is the length of its longest cycles. Jackson established a conjecture of Bondy by showing that the circumference of a 3-connected cubic graph of order $n$ is $\Omega(n^{0.694})$. Bilinski {\it et al.} improved…

Combinatorics · Mathematics 2019-12-02 Qinghai Liu , Xingxing Yu , Zhao Zhang

We give linear-time quasiconvex programming algorithms for finding a Moebius transformation of a set of spheres in a unit ball or on the surface of a unit sphere that maximizes the minimum size of a transformed sphere. We can also use…

Computational Geometry · Computer Science 2007-05-23 Marshall Bern , David Eppstein

We propose a new method to accurately approximate the Pompeiu-Hausdorff distance from a triangle soup A to another triangle soup B up to a given tolerance. Based on lower and upper bound computations, we discard triangles from A that do not…

Graphics · Computer Science 2024-06-18 Leonardo Sacht , Alec Jacobson