English
Related papers

Related papers: Random zero sets with local growth guarantees

200 papers

We use a new method to give conditions for the existence of a local isometric immersion of a Riemannian $n$-manifold $M$ in $\mathbb{R}^{n+k}$, for a given $n$ and $k$. These equate to the (local) existence of a $k$-tuple of scalar fields…

Differential Geometry · Mathematics 2019-09-02 Dan Gregorian Fodor

We complete the study concerning the minimization of the positive principal eigenvalue associated with a weighted Neumann problem settled in a bounded regular domain $\Omega\subset \mathbb{R}^{N}$, $N\ge2$, for the weight varying in a…

Analysis of PDEs · Mathematics 2024-07-26 Lorenzo Ferreri , Dario Mazzoleni , Benedetta Pellacci , Gianmaria Verzini

For a $d$-dimensional random vector $X$, let $p_{n, X}(\theta)$ be the probability that the convex hull of $n$ independent copies of $X$ contains a given point $\theta$. We provide several sharp inequalities regarding $p_{n, X}(\theta)$ and…

Probability · Mathematics 2023-01-11 Satoshi Hayakawa , Terry Lyons , Harald Oberhauser

For a fixed positive integer $d$ and a small real $p>0$, sample a $p$-random subset $A \subseteq \mathbb{Z}_{\geq 0}^d$, and let $S:=\langle A \rangle$ be the generalized numerical semigroup generated by $A$. We show that with high…

Combinatorics · Mathematics 2026-04-29 Veronica Bitonti , Noah Kravitz

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

We develop a new analysis of sampling-based motion planning in Euclidean space with uniform random sampling, which significantly improves upon the celebrated result of Karaman and Frazzoli (2011) and subsequent work. Particularly, we prove…

Robotics · Computer Science 2018-12-27 Kiril Solovey , Michal Kleinbort

It was shown by G. Pisier that any finite-dimensional normed space admits an $\alpha$-regular $M$-position, guaranteeing not only regular entropy estimates but moreover regular estimates on the diameters of minimal sections of its unit-ball…

Functional Analysis · Mathematics 2021-05-28 Emanuel Milman , Yuval Yifrach

We study isoperimetric inequalities on "slabs", namely weighted Riemannian manifolds obtained as the product of the uniform measure on a finite length interval with a codimension-one base. As our two main applications, we consider the case…

Differential Geometry · Mathematics 2025-10-14 Emanuel Milman

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

We consider the problem of computing the smallest possible distortion for embedding of a given n-point metric space into R^d, where d is fixed (and small). For d=1, it was known that approximating the minimum distortion with a factor better…

Computational Geometry · Computer Science 2009-09-29 Jiri Matousek , Anastasios Sidiropoulos

Given a star-shaped domain $K\subseteq \mathbb R^d$, $n$ vectors $v_1,\dots,v_n \in \mathbb R^d$, a number $R>0$, and i.i.d. random variables $\eta_1,\dots,\eta_n$, we study the geometric and arithmetic structure of the set of vectors $V =…

Probability · Mathematics 2015-10-15 Omer Friedland , Ohad Giladi , Olivier Guédon

Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…

Data Structures and Algorithms · Computer Science 2007-05-23 Yair Bartal , Manor Mendel

The worst case integration error in reproducing kernel Hilbert spaces of standard Monte Carlo methods with n random points decays as $n^{-1/2}$. However, re-weighting of random points can sometimes be used to improve the convergence order.…

Numerical Analysis · Mathematics 2018-01-26 Martin Ehler , Manuel Graef , Chris. J. Oates

The ellipsoid fitting conjecture of Saunderson, Chandrasekaran, Parrilo and Willsky considers the maximum number $n$ random Gaussian points in $\mathbb{R}^d$, such that with high probability, there exists an origin-symmetric ellipsoid…

Probability · Mathematics 2023-07-25 Madhur Tulsiani , June Wu

We study the asymptotic behavior of the maximal multiplicity $M_n=M_n(\sigma)$ of the blocks in a set partition of $[n]=\{1,2,...,n\}$, assuming that $\sigma$ is chosen uniformly at random from the set of all such partitions. Let $W=W(n)$…

Combinatorics · Mathematics 2019-10-21 Ljuben Mutafchiev , Mladen Savov

Motivated by the celebrated Beck-Fiala conjecture, we consider the random setting where there are $n$ elements and $m$ sets and each element lies in $t$ randomly chosen sets. In this setting, Ezra and Lovett showed an $O((t \log t)^{1/2})$…

Data Structures and Algorithms · Computer Science 2018-10-09 Nikhil Bansal , Raghu Meka

We introduce a randomized iterative fragmentation procedure for finite metric spaces, which is guaranteed to result in a polynomially large subset that is $D$-equivalent to an ultrametric, where $D\in (2,\infty)$ is a prescribed target…

Metric Geometry · Mathematics 2010-03-23 Assaf Naor , Terence Tao

A $(\beta,\delta,\Delta)$-padded decomposition of an edge-weighted graph $G = (V,E,w)$ is a stochastic decomposition into clusters of diameter at most $\Delta$ such that for every vertex $v\in V$, the probability that…

Data Structures and Algorithms · Computer Science 2025-10-15 Arnold Filtser , Tobias Friedrich , Davis Issac , Nikhil Kumar , Hung Le , Nadym Mallek , Ziena Zeif

Motivated by the vacuum selection problem of string/M theory, we study a new geometric invariant of a positive Hermitian line bundle $(L, h)\to M$ over a compact K\"ahler manifold: the expected distribution of critical points of a Gaussian…

Complex Variables · Mathematics 2007-11-13 Michael R. Douglas , Bernard Shiffman , Steve Zelditch

We give an embedding of the Poincar\'e halfspace $H^D$ into a discrete metric space based on a binary tiling of $H^D$, with additive distortion $O(\log D)$. It yields the following results. We show that any subset $P$ of $n$ points in $H^D$…

Computational Geometry · Computer Science 2024-04-02 Eunku Park , Antoine Vigneron
‹ Prev 1 3 4 5 6 7 10 Next ›