Skip to content

Author

Antonios Hmadi

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Jul 2026

Dimension-free cotype for isotropic log-concave random polytope spaces

Let $X_1,\ldots,X_N$ be independent random vectors in $\mathbb{R}^n$ with common isotropic log-concave distribution $\mu$ and set $P_{N,n}^{\mu}:=\operatorname{conv}\{\pm X_i:1\leqslant i\leqslant N\}$. Assume that $N/n=\gamma\geqslant \gamma_0$ where $\gamma_0>1$ is an absolute constant. We prove that with probability at least $1-C\gamma\exp(-c n^{1/4})$ every $k$-dimensional subspace $E$ of $(\mathbb{R}^n,\|\cdot\|_{P_{N,n}^{\mu}})$ satisfies $d_{\mathrm{BM}} (E,\ell_\infty^k) \geqslant c\gamma^{-C}k^\alpha$ for every $1\leqslant k\leqslant n$ where $c,C,\alpha>0$ are absolute constants. Consequently, with the same probability, $(\mathbb{R}^n,\|\cdot\|_{P_{N,n}^{\mu}})$ has cotype $q(\gamma)<\infty$ with cotype constant depending only on $\gamma$, in particular the cotype exponent and the cotype constant are independent of $n$ and of $\mu$. The proof adapts the deterministic coefficient scheme of Huang-Tikhomirov replacing the Gaussian estimates in their argument by estimates for isotropic log-concave random matrices. As an application, using the log-concave extension of Gluskin's theorem, we obtain a separable Banach space of finite cotype for which the Banach-Mazur diameter of its $k$-dimensional subspaces is of order $k$ and whose finite-dimensional building blocks are generated by isotropic log-concave random polytopes.

Antonios Hmadi · 0 citations
Preprint Aug 2026

Online balancing of vectors with small coordinates

Let $v_1,\ldots,v_T\in B_2^m$ be fixed in advance and revealed sequentially, and assume that $\|v_t\|_\infty\leqslant d^{-1/2}$ for some $d\geqslant 1$ and every $1\leqslant t\leqslant T$. There are absolute constants $L,C,c>0$ and a randomized online signing such that $$\mathbb{P}\left\{\max_{k\leqslant T}\left\|\sum_{t=1}^k\varepsilon_t v_t\right\|_\infty>6L\right\} \leqslant CT\exp\left(-\frac{cd}{\ln^2(ed)}\right).$$ Consequently, constant prefix discrepancy holds with probability at least $1-\varepsilon$ once $d$ is at least $C\ln\frac{3T}{\varepsilon}\left[\ln\left(e+\ln\frac{3T}{\varepsilon}\right)\right]^2$. In particular, every fixed sequence of vectors $a_t\in[-1,1]^m$ with at most $d$ nonzero coordinates admits an online signing with prefix discrepancy $O(\sqrt d)$ and failure probability at most $CT\exp[-cd/\ln^2(ed)]$. We also prove a nonuniform version in which the failure probability depends on the individual parameters $d_t=\|v_t\|_\infty^{-2}$, and a lower bound showing that a universal constant prefix discrepancy is impossible when $d=o(\ln T)$. We identify the corresponding $\ln^2 d$ barrier for the compact-potential method and extend the argument to general symmetric target bodies admitting a quadratic smoothness estimate.

Antonios Hmadi · 0 citations