Search arXiv⌕ Search

arXiv subjects

K. Tatarko

Publications and source records attributed to K. Tatarko.

3 recordsLinked to original sources

On random diameters of convex bodies

Let $K \subset \mathbb{R}^N$ be a convex body containing the origin in its interior. In this work, we study the diameters of random sections of $K$ and derive upper and lower bounds for them in terms of geometric parameters of $K$. Our bounds hold with large probability, and they offer new insights into this widely studied subject. Our upper bound complements the so-called low $M^*$-estimate and in many cases it is much sharper. The two lower bounds that we give are each of a different nature: depending on the body in question each time, either could be better, and in many interesting cases it matches the upper bound too. Subsequently, we apply our results to determine random diameters of $p$-ellipsoids (images of $\ell_p$ balls under diagonal operators), improving upon previously known results and achieving sharp estimates in many cases. One notable application is to Information-Based Complexity Theory, where we manage to establish a simple (and essentially optimal) dichotomy in response to a very natural conjecture posed by Hinrichs, Prochno and Sonnleitner in 2023. Our solution settles precisely when it is useful to replace the optimal information used for the recovery of vectors from a $p$-ellipsoid with random (Gaussian) information, which can be more practical to obtain.

math.FA↗

Answers to questions of Grünbaum and Loewner

We construct a convex body $K$ in $\mathbb{R}^n$, $n \geq 5$, with the property that there is exactly one hyperplane $H$ passing through $c(K)$, the centroid of $K$, such that the centroid of $K\cap H$ coincides with $c(K)$. This provides answers to questions of Grünbaum and Loewner for $n\geq 5$. The proof is based on the existence of non-intersection bodies in these dimensions.

math.MG↗

Random polytopes obtained by matrices with heavy tailed entries

Let $Γ$ be an $N\times n$ random matrix with independent entries and such that in each row entries are i.i.d. Assume also that the entries are symmetric, have unit variances, and satisfy a small ball probabilistic estimate uniformly. We investigate properties of the corresponding random polytope $Γ^* B_1^N$ in $\mathbb{R}$ (the absolute convex hull of rows of $Γ$). In particular, we show that $$ ΓB_1^N \supset b^{-1} \left( B_{\infty}^n \cap \sqrt{\ln (N/n)}\, B_2^n \right). $$ where $b$ depends only on parameters in small ball inequality. This extends results of \cite{LPRT} and recent results of \cite{KKR}. This inclusion is equivalent to so-called $\ell_1$-quotient property and plays an important role in compressive sensing (see \cite{KKR} and references therein).

math.FA↗