English
Related papers

Related papers: A remark on dimensionality reduction in discrete s…

200 papers

We work in the density model of random groups. We prove that they satisfy an isoperimetric inequality with sharp constant $1-2d$ depending upon the density parameter $d$. This implies in particular a property generalizing the ordinary $C'$…

Group Theory · Mathematics 2007-05-23 Yann Ollivier

For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…

Probability · Mathematics 2020-11-09 Michael P. Casey

Given $\boldsymbol{\alpha} \in [0,1]^d$, we estimate the smooth discrepancy of the Kronecker sequence $(n \boldsymbol{\alpha} \,\mathrm{mod}\, 1)_{n\geq 1}$. We find that it can be smaller than the classical discrepancy of $\textbf{any}$…

Number Theory · Mathematics 2024-09-26 Sam Chow , Niclas Technau

We introduce new flatness coefficients, which we call $\iota$-numbers, for Ahlfors $k$-regular sets in metric spaces ($k\in \mathbb{N}$). Using these coefficients for $k=1$, we characterize uniform $1$-rectifiability in rather general…

Metric Geometry · Mathematics 2025-05-22 Katrin Fässler , Ivan Yuri Violo

There is a constant c > 0 such that for every $\epsilon \in (0,1)$ and $n \geq 1/\epsilon^2$, the following holds. Any mapping from the $n$-point star metric into $\ell_1^d$ with bi-Lipschitz distortion $1+\epsilon$ requires dimension $$d…

Metric Geometry · Mathematics 2013-02-28 James R. Lee , Mohammad Moharrami

Let $(M,g)$ be a compact $n$-dimensional Riemannian manifold with nonempty boundary and $n\geq 2$. Assume that ${\mathrm{Ric}(M)\ge (n-1)K}$ for some ${K>0}$ and that $\partial M$ has nonnegative mean curvature with respect to the outward…

Differential Geometry · Mathematics 2025-12-29 Thomas Schürmann

Pick $n$ independent and uniform random points $U_1,\ldots,U_n$ in a compact convex set $K$ of $\mathbb{R}^d$ with volume 1, and let $P^{(d)}_K(n)$ be the probability that these points are in convex position. The Sylvester conjecture in…

Combinatorics · Mathematics 2024-11-14 Jean-François Marckert , Ludovic Morin

We prove that the $\frac12$-snowflake of a finite-dimensional normed space $(X,\|\cdot\|_X)$ embeds into a Hilbert space with quadratic average distortion $$O\Big(\sqrt{\log \mathrm{dim}(X)}\Big).$$ We deduce from this (optimal) statement…

Functional Analysis · Mathematics 2021-07-21 Assaf Naor

Let (X,d) be a metric space and (\Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of \Omega. Loosely speaking, these consist of points in \Omega…

Number Theory · Mathematics 2007-05-23 Simon Kristensen , Rebecca Thorn , Sanju Velani

Motivated by applications in combinatorial geometry, we consider the following question: Let $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_m)$ be an $m$-partition of a positive integer $n$, $S_i \subseteq \mathbb{C}^{\lambda_i}$ be finite…

Combinatorics · Mathematics 2022-04-13 M. Levent Doğan , Alperen A. Ergür , Jake D. Mundo , Elias Tsigaridas

In this paper, we give pinching Theorems for the first nonzero eigenvalue $\lambda$ of the Laplacian on the compact hypersurfaces of the Euclidean space. Indeed, we prove that if the volume of $M$ is 1 then, for any $\epsilon>0$, there…

Differential Geometry · Mathematics 2007-05-23 Bruno Colbois , Jean-Francois Grosjean

Motivated by the problem of compressing point sets into as few bits as possible while maintaining information about approximate distances between points, we construct random nonlinear maps $\varphi_\ell$ that compress point sets in the…

Computational Geometry · Computer Science 2024-03-05 Brett Leroux , Luis Rademacher

In this paper we prove that given any two point lattices $\Lambda_1 \subset \mathbb{R}^n$ and $ \Lambda_2 \subset \nobreak \mathbb{R}^{n-k}$, there is a set of $k$ vectors $\bm{v}_i \in \Lambda_1$ such that $\Lambda_2$ is, up to similarity,…

Computational Geometry · Computer Science 2013-11-13 Antonio Campello , João Strapasson , Sueli Costa

The metric dimension reduction modulus $k^\alpha_n(\ell_\infty)$ is the smallest $k$ such that every $n$--point metric space can be embedded into some $k$-dimensional normed space, with bi--Lipschitz distortion at most $\alpha$. Determining…

Metric Geometry · Mathematics 2025-08-12 Dylan J. Altschuler , Konstantin Tikhomirov

A major open problem in the field of metric embedding is the existence of dimension reduction for $n$-point subsets of Euclidean space, such that both distortion and dimension depend only on the {\em doubling constant} of the pointset, and…

Computational Geometry · Computer Science 2013-08-26 Yair Bartal , Lee-Ad Gottlieb , Ofer Neiman

We present a finite algorithm for computing the set of irreducible unitary representations of a real reductive group G. The Langlands classification, as formulated by Knapp and Zuckerman, exhibits any representation with an invariant…

Representation Theory · Mathematics 2017-10-16 Jeffrey Adams , Marc van Leeuwen , Peter Trapa , David A. Vogan

We obtain new bounds for (a variant of) the Furstenberg set problem for high dimensional flats over $\mathbb{R}^n$. In particular, let $F\subset \mathbb{R}^n$, $1\leq k \leq n-1$, $s\in (0,k]$, and $t\in (0,k(n-k)]$. We say that $F$ is a…

Classical Analysis and ODEs · Mathematics 2025-03-14 Paige Bright , Manik Dhar

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

Combinatorics · Mathematics 2025-01-30 Boris Bukh , Zichao Dong

We give, as $L$ grows to infinity, an explicit lower bound of order $L^{n/m}$ for the expected Betti numbers of the vanishing locus of a random linear combination of eigenvectors of $P$ with eigenvalues below $L$. Here, $P$ denotes an…

Spectral Theory · Mathematics 2016-04-20 Damien Gayet , Jean-Yves Welschinger

In 1733, Georges-Louis Leclerc, Comte de Buffon in France, set the ground of geometric probability theory by defining an enlightening problem: What is the probability that a needle thrown randomly on a ground made of equispaced parallel…

Information Theory · Computer Science 2015-07-23 Laurent Jacques
‹ Prev 1 3 4 5 6 7 10 Next ›