Related papers: New estimates for $d_{2,1}$ and $d_{3,2}$

We provide a reformulation of the hyperplane conjecture (the slicing problem) in terms of the floating body and give upper and lower bounds on the logarithmic Hausdorff distance between an arbitrary convex body $K\subset \mathbb{R}^{d}$\…

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…

Let $G$ be a second-countable amenable group with a uniform $k$-approximate lattice $\Lambda$. For a projective discrete series representation $(\pi, \mathcal{H}_{\pi})$ of $G$ of formal degree $d_{\pi} > 0$, we show that $D^-(\Lambda) \geq…

We give a shorter proof of a slightly weaker version of a theorem of Nets Katz and the author. We prove that if a set of $L$ lines in $\mathbb{R}^3$ contains at most $L^{1/2}$ lines in any low degree algebraic surface, then the number of…

We give a deterministic polynomial space construction for nearly optimal eps-nets with respect to any input n-dimensional convex body K and norm |.|. More precisely, our algorithm can build and iterate over an eps-net of K with respect to…

We introduce the vertex index, vein(K), of a given centrally symmetric convex body K, which, in a sense, measures how well K can be inscribed into a convex polytope with small number of vertices. This index is closely connected to the…

In this work we study subdivisions of $k$-rotationally symmetric planar convex bodies that minimize the maximum relative diameter functional. For some particular subdivisions called $k$-partitions, consisting of $k$ curves meeting in an…

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…

In this paper, a new proof of the following result is given: The product of the volumes of an origin symmetric convex bodies $K$ in R^2 and of its polar body is minimal if and only if $K$ is a parallelogram.

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…

Let $K\subset \mathbb{R}^n$, $n\geq 3$, be a convex body. A point $p$ the interior of $K$ is said to be a Larman point of $K$ if for every hyperplane $\Pi$ passing through $p$ the section $\Pi\cap K$ has a $(n-2)$-plane of symmetry. If $p$…

Let us say that an element of a given family $\A$ of subsets of $\R^d$ can be reconstructed using $n$ test sets if there exist $T_1,...,T_n \subset \R^d$ such that whenever $A,B\in \A$ and the Lebesgue measures of $A \cap T_i$ and $B \cap…

In this paper, we construct two convex bodies $K$ and $L$ in $\mathbb{R}^n$, $n\geq 3$, such that their projections $K|H$, $L|H$ onto every subspace $H$ are congruent, but nevertheless, $K$ and $L$ do not coincide up to a translation or a…

Let $K$ be a convex body and $K^\circ$ its polar body. Call $\phi(K)=\frac{1}{|K||K^\circ|}\int_K\int_{K^\circ}< x,y>^2 dxdy$. It is conjectured that $\phi(K)$ is maximum when $K$ is the euclidean ball. In particular this statement implies…

Given $d\geq 2$, we show that the number of approximates $\frac{1}{q}\mathbf{p}\in \mathbb{Q}^d$ of $\mathbf{x}\in\mathbb{R}^d$ satisfying $|q\mathbf{x}-\mathbf{p}|\leq cq^{-\frac{1}{d}}$ with denominator $1\leq q < T$ decays to the…

The present paper is devoted to establishing an optimal approximation exponent for the action of an irreducible uniform lattice subgroup of a product group on its proper factors. Previously optimal approximation exponents for lattice…

We prove that if the Hausdorff dimension of $E \subset {\Bbb R}^d$, $d \ge 3$, is greater than $\min \left\{ \frac{dk+1}{k+1}, \frac{d+k}{2} \right\},$ then the ${k+1 \choose 2}$-dimensional Lebesgue measure of $T_k(E)$, the set of…

We provide a new lower bound on the number of $(\leq k)$-edges of a set of $n$ points in the plane in general position. We show that for $0 \leq k \leq\lfloor\frac{n-2}{2}\rfloor$ the number of $(\leq k)$-edges is at least $$ E_k(S) \geq…

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…

Let $f(n,k)$ be the minimum number of edges that must be removed from some complete geometric graph $G$ on $n$ points, so that there exists a tree on $k$ vertices that is no longer a planar subgraph of $G$. In this paper we show that…