相关论文: Low $M^*$-estimates on coordinate subspaces

Generalizing the slicing inequality for functions on convex bodies from [11], it was proved in [4] that there exists an absolute constant $c$ so that for any $n\in \mathbb N$, any $q\in [0,n-1)$ which is not an odd integer, any…

We prove that there exists an absolute constant $\alpha >1$ with the following property: if $K$ is a convex body in ${\mathbb R}^n$ whose center of mass is at the origin, then a random subset $X\subset K$ of cardinality ${\rm…

Let $C$ and $K$ be centrally symmetric convex bodies in ${\mathbb R}^n$. We show that if $C$ is isotropic then \begin{equation*}\|{\bf t}\|_{C^s,K}=\int_{C}\cdots\int_{C}\Big\|\sum_{j=1}^st_jx_j\Big\|_K\,dx_1\cdots dx_s \leq c_1L_C(\log…

We give bounds on the successive minima of an $o$-symmetric convex body under the restriction that the lattice points realizing the successive minima are not contained in a collection of forbidden sublattices. Our investigations extend…

For every convex disk $K$ (a convex compact subset of the plane, with non-void interior), the packing density $\delta(K)$ and covering density $\vartheta(K)$ form an ordered pair of real numbers, {\em i.e.}, a point in ${\mathbb R}^2$. The…

We show that the rate of convergence on the approximation of volumes of a convex symmetric polytope P in R^n by its dual L_{p$-centroid bodies is independent of the geometry of P. In particular we show that if P has volume 1,…

Let $K \subset {\mathbb R}^2$ be an $o$-symmetric convex body, and $K^*$ its polar body. Then we have $|K|\cdot |K^*| \ge 8$, with equality if and only if $K$ is a parallelogram. ($| \cdot |$ denotes volume). If $K \subset {\mathbb R}^2$ is…

Let ${\mathfrak M}=({\mathcal M},\rho)$ be a metric space and let $X$ be a Banach space. Let $F$ be a set-valued mapping from ${\mathcal M}$ into the family ${\mathcal K}_m(X)$ of all compact convex subsets of $X$ of dimension at most $m$.…

We study the slicing inequality for the surface area instead of volume. This is the question whether there exists a constant $\alpha_n$ depending (or not) on the dimension $n$ so that $$S(K)\leq\alpha_n|K|^{\frac{1}{n}}\max_{\xi\in…

Effective estimates for the lattice point discrepancy of certain planar and three-dimensional domains. This paper provides estimates, with explicit constants, for the lattice point discrepancy of o-symmetric ellipse discs and ellipsoids in…

Every convex body K in R^n has a coordinate projection PK that contains at least vol(0.1 K) cells of the integer lattice PZ^n, provided this volume is at least one. Our proof of this counterpart of Minkowski's theorem is based on an…

For any origin-symmetric convex body $K$ in $\mathbb{R}^n$ in isotropic position, we obtain the bound: \[ M^*(K) \leq C \sqrt{n} \log(n)^2 L_K ~, \] where $M^*(K)$ denotes (half) the mean-width of $K$, $L_K$ is the isotropic constant of…

We consider a generalization of the hyperplane problem to arbitrary measures in place of volume and to sections of lower dimensions. We prove this generalization for unconditional convex bodies and for duals of bodies with bounded volume…

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…

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…

For a convex body B in three-dimensional Euclidean space, which is invariant under rotations around one coordinate axis and has a smooth boundary of bounded nonzero curvature, the lattice point discrepancy (number of integer points minus…

Extending results of Suss and Hadwiger (proved by them for the case of convex bodies and positive ratios), we show that compact (respectively, closed) convex sets in the Euclidean space of dimension n are homothetic provided for any given…

Let $F$ be a set-valued mapping which to each point $x$ of a metric space $({\mathcal M},\rho)$ assigns a convex closed set $F(x)\subset{\bf R}^2$. We present several constructive criteria for the existence of a Lipschitz selection of $F$,…

It is not surprising that one should expect that the degree of constrained (shape preserving) approximation be worse than the degree of unconstrained approximation. However, it turns out that, in certain cases, these degrees are the same.…

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},$…