Related papers: Almost Euclidean sections of the N-dimensional cro…
It is shown by the author in 2017 that for the union of N orthants in the n-dimensional space there exists an efficient and systematic way to find the exact value, using a suitable partial order relation construction. In this paper our…
Given independent standard Gaussian points $v_1, \ldots, v_n$ in dimension $d$, for what values of $(n, d)$ does there exist with high probability an origin-symmetric ellipsoid that simultaneously passes through all of the points? This…
We prove that with high probability, a uniform sample of $n$ points in a convex domain in $\mathbb{R}^d$ can be rounded to points on a grid of step size proportional to $1/n^{d+1+\epsilon}$ without changing the underlying chirotope…
The quantum Euclidean space R_{q}^{N} is a kind of noncommutative space which is obtained from ordinary Euclidean space R^{N} by deformation with parameter q. When N is odd, the structure of this space is similar to R_{q}^{3}. Motivated by…
The celebrated Dvoretzky theorem asserts that every $N$-dimensional convex body admits central sections of dimension $d = \Omega(\log N)$, which is nearly spherical. For many instances of convex bodies, typically unit balls with respect to…
We show that directed minimal cones in (n+1)-dimensional Euclidean space which have at most one singularity are - besides the trivial cases: empty set, whole space - half spaces. Using blow-up techniques, this result can be used to get…
We establish some characterizations of elliptic hyperboloids (resp., ellipsoids) in the $(n+1)$-dimensional Euclidean space ${\Bbb E}^{n+1}$, using the $n$-dimensional area of the sections cut off by hyperplanes and the $(n+1)$-dimensional…
Suppose a language $L$ can be decided by a bounded-error randomized algorithm that runs in space $S$ and time $n \cdot \text{poly}(S)$. We give a randomized algorithm for $L$ that still runs in space $O(S)$ and time $n \cdot \text{poly}(S)$…
A disordered medium is often constructed by $N$ points independently and identically distributed in a $d$-dimensional hyperspace. Characteristics related to the statistics of this system is known as the random point problem. As $d \to…
This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…
In this work we give an efficient construction of unitary $k$-designs using $\tilde{O}(k\cdot poly(n))$ quantum gates, as well as an efficient construction of a parallel-secure pseudorandom unitary (PRU). Both results are obtained by giving…
Consider the sum of the first $N$ eigenspaces for the Laplacian on a Riemannian manifold. A basis for this space determines a map to Euclidean space and for $N$ sufficiently large the map is an embedding. In analogy with a fruitful idea of…
We construct a quasiconformal mapping of $n$-dimensional Euclidean space, $n \geq 2$, that simultaneously distorts the Hausdorff dimension of a nearly maximal collection of parallel lines by a given amount. This answers a question of…
Asymptotic normality for the natural volume measure of random polytopes generated by random points distributed uniformly in a convex body in spherical or hyperbolic spaces is proved. Also the case of Hilbert geometries is treated and…
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…
Randomization of quantum states is the quantum analogue of the classical one-time pad. We present an improved, efficient construction of an approximately randomizing map that uses O(d/epsilon^2) Pauli operators to map any d-dimensional…
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…
For $N\geq n$, let $P_{N,n}$ be a random polytope in ${\mathbb R}^n$ with vertices $\pm X_i$, $1\leq i\leq N$, where $X_1,\dots,X_N$ are i.i.d standard Gaussian vectors in ${\mathbb R}^n$. Random polytopes $P_{N,n}$, as well as their duals,…
We show that a subspace of of $\ell_\infty^N$ of dimension $n>(\log N\log \log N)^2$ contains $2$-isomorphic copies of $\ell_\infty^k$ where $k$ tends to infinity with $n/(\log N\log \log N)^2$. More precisely, for every $\eta>0$, we show…
We study the problem of representing all distances between $n$ points in $\mathbb R^d$, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for…