English
Related papers

Related papers: Almost Euclidean sections of the N-dimensional cro…

200 papers

We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…

Combinatorics · Mathematics 2021-07-21 Gil Kalai , Leonard J. Schulman

We study the existence of cubic quotients of finite-dimensional quasi-normed spaces, that is, quotients well isomorphic to $\ell_{\infty}^k$ for some $k.$ We give two results of this nature. The first guarantees a proportional dimensional…

Functional Analysis · Mathematics 2007-05-23 N. J. Kalton , A. E. Litvak

We consider the problem of approximating a subset $M$ of a Hilbert space $X$ by a low-dimensional manifold $M_n$, using samples from $M$. We propose a nonlinear approximation method where $M_n $ is defined as the range of a smooth nonlinear…

Numerical Analysis · Mathematics 2025-11-20 Antoine Bensalah , Anthony Nouy , Joel Soffo

Let $\mathbb{B}_p^N$ be the $N$-dimensional unit ball corresponding to the $\ell_p$-norm. For each $N\in\mathbb N$ we sample a uniform random subspace $E_N$ of fixed dimension $m\in\mathbb{N}$ and consider the volume of $\mathbb{B}_p^N$…

Probability · Mathematics 2024-12-23 Joscha Prochno , Christoph Thaele , Philipp Tuchel

Spanners for low dimensional spaces (e.g. Euclidean space of constant dimension, or doubling metrics) are well understood. This lies in contrast to the situation in high dimensional spaces, where except for the work of Har-Peled, Indyk and…

Data Structures and Algorithms · Computer Science 2018-04-23 Arnold Filtser , Ofer Neiman

Parallelograms are one of the basic building blocks in two-dimensional tiling. They have important applications in a wide variety of science and engineering fields, such as wireless communication networks, urban transportation, operations…

General Mathematics · Mathematics 2013-07-04 Yanyan Zhuang , Jianping Pan

Let $A$ be a compact $d$-dimensional $C^2$ Riemannian manifold with boundary, embedded in ${\bf R}^m$ where $m \geq d \geq 2$, and let $B$ be a nice subset of $A$ (possibly $B=A$). Let $X_1,X_2, \ldots $ be independent random uniform points…

Probability · Mathematics 2025-09-24 Mathew D. Penrose , Xiaochuan Yang

We give a deterministic polynomial space construction for nearly optimal eps-nets with respect to any input n-dimensional convex body K and norm |.|. More precisely, our algorithm can build and iterate over an eps-net of K with respect to…

Computational Complexity · Computer Science 2013-12-04 Daniel Dadush

Let $X$ be a normed space that satisfies the Johnson-Lindenstrauss lemma (J-L lemma, in short) in the sense that for any integer $n$ and any $x_1,\ldots,x_n\in X$ there exists a linear mapping $L:X\to F$, where $F\subseteq X$ is a linear…

Functional Analysis · Mathematics 2008-07-29 William B. Johnson , Assaf Naor

Simulating the dynamics of charged particles in quasi-two-dimensional (quasi-2D) nanoconfined systems presents a significant computational challenge due to the long-range nature of electrostatic interactions and the geometric anisotropy. To…

Soft Condensed Matter · Physics 2026-01-07 Zecheng Gan , Xuanzhao Gao , Yuqing Li

We determine the submaximal dimensions of the spaces of almost Einstein scales and normal conformal Killing fields for connected conformal manifolds. The results depend on the signature and dimension $n$ of the conformally nonflat conformal…

Differential Geometry · Mathematics 2024-01-09 Jan Gregorovič , Josef Šilhan

Random embeddings project high-dimensional spaces to low-dimensional ones; they are careful constructions which allow the approximate preservation of key properties, such as the pair-wise distances between points. Often in the field of…

Optimization and Control · Mathematics 2022-06-08 Zhen Shao

The problems of random projections and sparse reconstruction have much in common and individually received much attention. Surprisingly, until now they progressed in parallel and remained mostly separate. Here, we employ new tools from…

Data Structures and Algorithms · Computer Science 2010-06-01 Nir Ailon , Edo Liberty

Previous studies have shown that supersymmetric partition function on $T^2 \times S^2$ is related to elliptic genus of two dimensional supersymmetric theory. In this short note we find a four dimensional supersymmetric theory, whose…

High Energy Physics - Theory · Physics 2016-02-02 Masazumi Honda

We construct algorithms that efficiently generate random factorisations of values $P(n)$ as products of two integers, where $P\in\mathbb{Z}[x]$ is a given quadratic or cubic monic polynomial. In other words, the algorithms produce random…

Number Theory · Mathematics 2025-08-13 Dmitry Badziahin

Given a set $P$ of $n$ points in $\mathbb{R}^3$, we show that, for any $\varepsilon >0$, there exists an $\varepsilon$-net of $P$ for halfspace ranges, of size $O(1/\varepsilon)$. We give five proofs of this result, which are arguably…

Computational Geometry · Computer Science 2014-10-14 Sariel Har-Peled , Haim Kaplan , Micha Sharir , Shakhar Smorodinsky

Let ${\pmb M}$, ${\pmb N}$ and ${\pmb K}$ be $d$-dimensional Riemann manifolds. Assume that ${\bf A}:=(A_n)_{n\in{\Bbb N}}$ is a sequence of Lebesgue measurable subsets of ${\pmb M}$ satisfying a necessary density condition and ${\bf…

Classical Analysis and ODEs · Mathematics 2015-09-01 De-Jun Feng , Esa Järvenpää , Maarit Järvenpää , Ville Suomala

We find the minimal dimension for a truncated polynomial algebra over an arbitrary field for which there exists a "non-thin" subalgebra. Moreover, we discuss examples of subalgebras, and count them in low dimensions.

Commutative Algebra · Mathematics 2019-01-01 Francisco Franco Munoz

We introduce a partial order on the set of all normal polytopes in R^d. This poset NPol(d) is a natural discrete counterpart of the continuum of convex compact sets in R^d, ordered by inclusion, and exhibits a remarkably rich combinatorial…

Combinatorics · Mathematics 2016-02-23 Winfried Bruns , Joseph Gubeladze , Mateusz Michałek

We consider low-space algorithms for the classic Element Distinctness problem: given an array of $n$ input integers with $O(\log n)$ bit-length, decide whether or not all elements are pairwise distinct. Beame, Clifford, and Machmouchi [FOCS…

Data Structures and Algorithms · Computer Science 2021-11-03 Lijie Chen , Ce Jin , R. Ryan Williams , Hongxun Wu
‹ Prev 1 3 4 5 6 7 10 Next ›