English
Related papers

Related papers: Nearly Optimal Embeddings of Flat Tori

200 papers

In this note, we generalize a characterization of the Clifford torus due to Ros. Let $f:M\rightarrow S^{n+1}$ be an embedded closed minimal hypersurface. Assume there are $(n+2)$ great hyperspheres of $S^{n+1}$ perpendicular to each other,…

Differential Geometry · Mathematics 2020-11-02 Changping Wang , Peng Wang

We show that there exists a lattice covering of $\mathbb{R}^n$ by Eucledian spheres of equal radius with density $O\big(n \ln^{\beta} n \big)$ as $n\to\infty$, where \begin{align*} \beta := \frac{1}{2} \log_2 \left(\frac{8 \pi…

Metric Geometry · Mathematics 2025-08-11 Jun Gao , Xizhi Liu , Oleg Pikhurko , Shumin Sun

Extending work of Kapouleas and Yang, for any integers $N \geq 2$, $k, \ell \geq 1$, and $m$ sufficiently large, we apply gluing methods to construct in the round $3$-sphere a closed embedded minimal surface that has genus $k\ell…

Differential Geometry · Mathematics 2020-07-28 David Wiygul

We study integration and $L_2$-approximation on countable tensor products of function spaces of increasing smoothness. We obtain upper and lower bounds for the minimal errors, which are sharp in many cases including, e.g., Korobov, Walsh,…

Numerical Analysis · Mathematics 2021-09-21 M. Gnewuch , M. Hefter , A. Hinrichs , K. Ritter , G. W. Wasilkowski

We introduce and study the \emph{Lattice Distortion Problem} (LDP). LDP asks how "similar" two lattices are. I.e., what is the minimal distortion of a linear bijection between the two lattices? LDP generalizes the Lattice Isomorphism…

Data Structures and Algorithms · Computer Science 2016-11-01 Huck Bennett , Daniel Dadush , Noah Stephens-Davidowitz

This paper presents a near-optimal distributed approximation algorithm for the minimum-weight connected dominating set (MCDS) problem. The presented algorithm finds an $O(\log n)$ approximation in $\tilde{O}(D+\sqrt{n})$ rounds, where $D$…

Data Structures and Algorithms · Computer Science 2014-05-01 Mohsen Ghaffari

We describe the space of isometric immersions from the Lorentz plane $L^2$ into the 3-dimensional anti-de Sitter space, and solve several open problems of this context raised by M. Dajczer and K. Nomizu in 1981. We also obtain from the…

Differential Geometry · Mathematics 2009-05-26 Maria A. Leon-Guzman , Pablo Mira , Jose A. Pastor

A subset $B$ of the ring $\mathbb{Z}_n$ is referred to as a $\ell$-covering set if $\{ ab \pmod n | 0\leq a \leq \ell, b\in B\} = \mathbb{Z}_n$. We show that there exists a $\ell$-covering set of $\mathbb{Z}_n$ of size $O(\frac{n}{\ell}\log…

Discrete Mathematics · Computer Science 2024-06-11 Ke Shi , Chao Xu

It is shown that every tree of size $n$ over a fixed set of $\sigma$ different ranked symbols can be decomposed (in linear time as well as in logspace) into $O\big(\frac{n}{\log_\sigma n}\big) = O\big(\frac{n \log \sigma}{\log n}\big)$ many…

Data Structures and Algorithms · Computer Science 2015-09-22 Moses Ganardi , Danny Hucke , Artur Jez , Markus Lohrey , Eric Noeth

Two discrete N-level alternatives to the popular imaginary cubic oscillator are proposed and studied. In a certain domain ${\cal D}$ of parameters $a$ and $z$ of the model, the spectrum of energies is shown real (i.e., potentially,…

Mathematical Physics · Physics 2012-02-06 Miloslav Znojil

We prove that every smooth compact submanifold of $\R^n$ can be approximated up to a small isotopy by the real locus of a nonsingular complex algebraic subset of $\C^n$ defined over $\R$. This settles a version of a conjecture posed in 1952…

Algebraic Geometry · Mathematics 2026-05-25 Juliusz Banecki

Given a finite-dimensional inner product space $V$ and a group $G$ of isometries, we consider the problem of embedding the orbit space $V/G$ into a Hilbert space in a way that preserves the quotient metric as well as possible. This inquiry…

Metric Geometry · Mathematics 2025-06-06 Ben Blum-Smith , Harm Derksen , Dustin G. Mixon , Yousef Qaddura , Brantley Vose

Goemans showed that any $n$ points $x_1, \dotsc x_n$ in $d$-dimensions satisfying $\ell_2^2$ triangle inequalities can be embedded into $\ell_{1}$, with worst-case distortion at most $\sqrt{d}$. We extend this to the case when the points…

Data Structures and Algorithms · Computer Science 2015-12-15 Amit Deshpande , Prahladh Harsha , Rakesh Venkat

In this paper, we study $n$-dimensional complete minimal hypersurfaces in a unit sphere. We prove that an $n$-dimensional complete minimal hypersurface with constant scalar curvature in a unit sphere with $f_3$ constant is isometric to the…

Differential Geometry · Mathematics 2021-04-30 Qing-Ming Cheng , Guoxin Wei , Takuya Yamashiro

We prove that given a discrete space with $n$ points which is either embedded in a system of $k$ trees, or the Cartesian product of $k$ trees, we can compute all eccentricities in ${\cal O}(2^{{\cal O}(k\log{k})}(N+n)^{1+o(1)})$ time, where…

Data Structures and Algorithms · Computer Science 2020-10-30 Guillaume Ducoffe

Given a set $ P $ of $n$ points and a set $ H $ of $n$ half-planes in the plane, we consider the problem of computing a smallest subset of points such that each half-plane contains at least one point of the subset. The previously best…

Computational Geometry · Computer Science 2025-01-07 Gang Liu , Haitao Wang

Generalizing earlier work by Ros in ambient dimension three, we prove an affine lower bound for the Morse index of closed minimal hypersurfaces inside a flat torus in terms of their first Betti number (with purely dimensional coefficients).

Differential Geometry · Mathematics 2017-05-29 Lucas Ambrozio , Alessandro Carlotto , Ben Sharp

We prove a universal lower bound for the $L^{n/2}$-norm of the Weyl tensor in terms of the Betti numbers for compact $n$-dimensional Riemannian manifolds that are conformally immersed as hypersurfaces in the Euclidean space. As a…

Differential Geometry · Mathematics 2017-10-25 Christos-Raent Onti , Theodoros Vlachos

For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung , Marina V. Semenova

We present an $O(n\sqrt{\log n})$ time and linear space algorithm for sorting real numbers. This breaks the long time illusion that real numbers have to be sorted by comparison sorting and take $\Omega (n\log n)$ time to be sorted.

Data Structures and Algorithms · Computer Science 2018-12-04 Yijie Han
‹ Prev 1 3 4 5 6 7 10 Next ›