English
Related papers

Related papers: Low Dimensional Euclidean Volume Preserving Embedd…

200 papers

The Johnson-Lindenstrauss transform is a fundamental method for dimension reduction in Euclidean spaces, that can map any dataset of $n$ points into dimension $O(\log n)$ with low distortion of their distances. This dimension bound is tight…

Data Structures and Algorithms · Computer Science 2026-02-20 Shaofeng H. -C. Jiang , Robert Krauthgamer , Shay Sapir , Sandeep Silwal , Di Yue

For any $\Lambda>0$, let $\mathcal{M}_{n,\Lambda}$ denote the space containing all locally Lipschitz minimal graphs of dimension $n$ and of arbitrary codimension $m$ in Euclidean space $\mathbb{R}^{n+m}$ with uniformly bounded 2-dilation…

Differential Geometry · Mathematics 2021-09-21 Qi Ding , J. Jost , Y. L. Xin

We show that the problem of finding the simplex of largest volume in the convex hull of $n$ points in $\mathbb{Q}^d$ can be approximated with a factor of $O(\log d)^{d/2}$ in polynomial time. This improves upon the previously best known…

Computational Geometry · Computer Science 2014-06-16 Marco Di Summa , Friedrich Eisenbrand , Yuri Faenza , Carsten Moldenhauer

Oblivious low-distortion subspace embeddings are a crucial building block for numerical linear algebra problems. We show for any real $p, 1 \leq p < \infty$, given a matrix $M \in \mathbb{R}^{n \times d}$ with $n \gg d$, with constant…

Data Structures and Algorithms · Computer Science 2014-03-19 David P. Woodruff , Qin Zhang

We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…

Computational Geometry · Computer Science 2007-05-23 Rina Panigrahy

Given a set P of n points in |R^d, an eps-kernel K subset P approximates the directional width of P in every direction within a relative (1-eps) factor. In this paper we study the stability of eps-kernels under dynamic insertion and…

Computational Geometry · Computer Science 2010-03-31 Pankaj K. Agarwal , Jeff M. Phillips , Hai Yu

We study a higher-dimensional analogue of the {Random Travelling Salesman Problem}: let the complete $d$-dimensional simplicial complex $K_n^{d}$ on $n$ vertices be equipped with i.i.d.\ volumes on its facets, uniformly random in $[0,1]$.…

Probability · Mathematics 2024-09-04 Agelos Georgakopoulos , John Haslegrave , Joel Larsson Danielsson

Consider a dataset of n(d) points generated independently from R^d according to a common p.d.f. f_d with support(f_d) = [0,1]^d and sup{f_d([0,1]^d)} growing sub-exponentially in d. We prove that: (i) if n(d) grows sub-exponentially in d,…

Databases · Computer Science 2009-09-01 Chris Giannella

Let $\mathcal{X}$ be a complex projective manifold of dimension $n$ defined over the reals and let $M$ denote its real locus. We study the vanishing locus $Z\_{s\_d}$ in $M$ of a random real holomorphic section $s\_d$ of $\mathcal{E}…

Metric Geometry · Mathematics 2019-12-20 Thomas Letendre

The collection of all $n$-point metric spaces of diameter $\le 1$ constitutes a polytope $\mathcal{M}_n \subset \mathbb{R}^{\binom{n}{2}}$, called the \emph{Metric Polytope}. In this paper, we consider the best approximations of…

Metric Geometry · Mathematics 2023-05-04 Raziel Gartsman , Nati Linial

Fix $p>2$. We prove that the Euclidean distortion of every $n$-point subset of $L_p$ is $p^3(\log n)^{\frac12+o(1)}$, thus, in particular, demonstrating that all $n$-point subsets of $L_p$ exhibit an asymptotic improvement over the $O(\log…

Functional Analysis · Mathematics 2026-03-24 Assaf Naor , Kevin Ren

Low-distortion embeddings are critical building blocks for developing random sampling and random projection algorithms for linear algebra problems. We show that, given a matrix $A \in \R^{n \times d}$ with $n \gg d$ and a $p \in [1, 2)$,…

Data Structures and Algorithms · Computer Science 2013-03-22 Xiangrui Meng , Michael W. Mahoney

This paper presents a construction of a proper and stable labelled sample compression scheme of size $O(\VCD^2)$ for any finite concept class, where $\VCD$ denotes the Vapnik-Chervonenkis Dimension. The construction is based on a well-known…

Machine Learning · Computer Science 2022-12-29 Farnam Mansouri , Sandra Zilles

We consider vectorial problems in the calculus of variations with an additional pointwise constraint. Our admissible mappings ${\bf n}:\mathbb{R}^k\rightarrow \mathbb{R}^d$ satisfy ${\bf n}(x)\in M$, where $M$ is a manifold embedded in…

Analysis of PDEs · Mathematics 2014-11-14 S. J. Bedford

We consider the volume of the largest axis-parallel box in the $d$-dimensional torus that contains no point of a given point set $\mathcal{P}_n$ with $n$ elements. We prove that, for all natural numbers $d, n$ and every point set…

Computational Complexity · Computer Science 2019-08-15 Mario Ullrich

This paper introduces a natural definition for the volume of the unit ball in $n$-dimensional normed spaces $\mathbb{R}^n$. This definition preserves the Euclidean relation $P(B)/V(B)=n$ between the perimiter and the volume of the unit ball…

Metric Geometry · Mathematics 2026-05-05 Gershon Wolansky

In this paper we will explore fundamental constraints on the evolution of certain symplectic subvolumes possessed by any Hamiltonian phase space. This research has direct application to optimal control and control of conservative mechanical…

Optimization and Control · Mathematics 2007-09-11 Jared M. Maruskin , Daniel J. Scheeres , Anthony M. Bloch

This article extends the known restricted isometric projection of sparse datasets in Euclidean spaces $\mathbb{R}^N$ down into low-dimensional subspaces $\mathbb{R}^k, k \ll N,$ to the case of low-dimensional varieties $\mathcal{M} \subset…

Mathematical Physics · Physics 2024-05-13 Vasile Pop , Iuliana Teodorescu , Razvan Teodorescu

For any $n$-dimensional simplex in the Euclidean space $\mathbb{R}^n$ with $n\ge 4$, it is asked that if a continuous deformation preserves the volumes of all the codimension 2 faces, then is it necessarily a \emph{rigid} motion. While the…

Metric Geometry · Mathematics 2025-01-22 Lizhao Zhang

There are two positive, absolute constants $c_{1}$ and $c_{2}$ so that the volume of the difference set of the $d$-dimensional Euclidean ball and an inscribed polytope with n vertices is larger than $$ c_{2}\ d\…

Metric Geometry · Mathematics 2008-02-03 Yehoram Gordon , Shlomo Reisner , Carsten Schütt