Related papers: Towards a Constructive Version of Banaszczyk's Vec…

We study the problem of reconstructing a convex body using only a finite number of measurements of outer normal vectors. More precisely, we suppose that the normal vectors are measured at independent random locations uniformly distributed…

We give a sharp lower bound to the largest possible Euclidean norm of signed sums of $n$ vectors in the plane. This is achieved by connecting the signed vector sum problem to the isoperimetric problem for the circumradius of polygons. In…

Let $C$ and $K$ be centrally symmetric convex bodies of volume $1$ in ${\mathbb R}^n$. We provide upper bounds for the multi-integral expression \begin{equation*}\|{\bf…

Many star bodies have convex subsets with approximately the same Gaussian measure (of the complement). Inspired by this phenomenon, and in connection with the randomized Dvoretzky theorem for Lorentz spaces, we derive bounds on the…

We prove Gaussian approximation theorems for specific $k$-dimensional marginals of convex bodies which possess certain symmetries. In particular, we treat bodies which possess a 1-unconditional basis, as well as simplices. Our results…

It was shown in [11] that for every origin-symmetric star body $K \subseteq \mathbb R^n$ of volume $1$, every even continuous probability density $f$ on $K$ and $1 \leq k \leq n-1$, there exists a subspace $F \subseteq \mathbb R^n$ of…

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

Given a subset $A$ of $\mathbb{R}^n$, we define \begin{align*} \mathrm{conv}_k(A) := \left\{ \lambda_1 s_1 + \cdots + \lambda_k s_k : \lambda_i \in [0,1], \sum_{i=1}^k \lambda_i = 1 , s_i \in A \right\} \end{align*} to be the set of vectors…

We prove that for any semi-norm $\|\cdot\|$ on $\mathbb{R}^n,$ and any symmetric convex body $K$ in $\mathbb{R}^n,$ \begin{equation}\label{ineq-abs2} \int_{\partial K} \frac{\|n_x\|^2}{\langle x,n_x\rangle}\leq…

We study the lower bound for Koldobsky's slicing inequality. We show that there exists a measure $\mu$ and a symmetric convex body $K \subseteq \mathbb{R}^n$, such that for all $\xi\in S^{n-1}$ and all $t\in \mathbb{R},$…

We present an alternative approach to some results of Koldobsky on measures of sections of symmetric convex bodies, which allows us to extend them to the not necessarily symmetric setting. We prove that if $K$ is a convex body in ${\mathbb…

Estimating the volume of a convex body is a central problem in convex geometry and can be viewed as a continuous version of counting. We present a quantum algorithm that estimates the volume of an $n$-dimensional convex body within…

This article derives closed-form parametric formulas for the Minkowski sums of convex bodies in d-dimensional Euclidean space with boundaries that are smooth and have all positive sectional curvatures at every point. Under these conditions,…

The vector-balancing problem is a fundamental problem in discrepancy theory: given T vectors in $[-1,1]^n$, find a signing $\sigma(a) \in \{\pm 1\}$ of each vector $a$ to minimize the discrepancy $\| \sum_{a} \sigma(a) \cdot a \|_{\infty}$.…

Let $\gamma_n$ be the standard Gaussian measure on $\mathbb{R}^n$. We prove that for every symmetric convex sets $K,L$ in $\mathbb{R}^n$ and every $\lambda\in(0,1)$, $$\gamma_n(\lambda K+(1-\lambda)L)^{\frac{1}{n}} \geq \lambda…

In this work, we describe a generic approach to show convergence with high probability for both stochastic convex and non-convex optimization with sub-Gaussian noise. In previous works for convex optimization, either the convergence is only…

In this paper, we study the existence of solutions for generalized vector quasi-equilibrium problems. Firstly, we prove that in the case of Banach spaces, the assumptions of continuity over correspondences can be weakened. The theoretical…

We study the problem of chasing convex bodies online: given a sequence of convex bodies $K_t\subseteq \mathbb{R}^d$ the algorithm must respond with points $x_t\in K_t$ in an online fashion (i.e., $x_t$ is chosen before $K_{t+1}$ is…

We give a deterministic O(log n)^n algorithm for the {\em Shortest Vector Problem (SVP)} of a lattice under {\em any} norm, improving on the previous best deterministic bound of n^O(n) for general norms and nearly matching the bound of…

We consider exact algorithms for Subset Balancing, a family of related problems that generalizes Subset Sum, Partition, and Equal Subset Sum. Specifically, given as input an integer vector $\vec{x} \in \mathbb{Z}^n$ and a constant-size…