相关论文: On Symplectic Capacities and Volume Radius

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

In this paper we describe the intersection between the balls of maximal symplectic packings of $\P^2$. This analysis shows the existence of singular points for maximal packings of $\P^2$ by more than three equal balls. It also yields a…

We survey some recent progress on understanding when one four-dimensional symplectic manifold can be symplectically embedded into another. In 2010, McDuff established a number-theoretic criterion for the existence of a symplectic embedding…

For any nonempty, compact and fiberwise convex set $K$ in $T^*\mathbb{R}^n$, we prove an isomorphism between symplectic homology of $K$ and a certain relative homology of loop spaces of $\mathbb{R}^n$. We also prove a formula which computes…

The study of rod complements is motivated by rod packing structures in crystallography. We view them as complements of links comprised of Euclidean geodesics in the 3-torus. Recent work of the second author classifies when such rod…

We provide an overview of technics that lead to an Euclidean upper bound on the volume of geodesic balls.

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…

Let $K$ and $L$ be two convex bodies in $\mathbb R^n$, $n\geq 2$, with $L\subset \text{int}\, K$. We say that $L$ is an equichordal body for $K$ if every chord of $K$ tangent to $L$ has length equal to a given fixed value $\lambda$. J.…

In every dimension $d\ge1$, we establish the existence of a constant $v_d>0$ and of a subset $\mathcal U_d$ of $\mathbb R^d$ such that the following holds: $\mathcal C+\mathcal U_d=\mathbb R^d$ for every convex set $\mathcal C\subset…

We study a specific convex maximization problem in n-dimensional space. The conjectured solution is proved to be a vertex of the polyhedral feasible region, but only a partial proof of local maximality is known. Integer sequences with…

Lipschitz constants for the width and diameter functions of a convex body in $\mathbb R^n$ are found in terms of its diameter and thickness (maximum and minimum of both functions). Also, a dual approach to thickness is proposed.

Up to a factor 1/n!, the volume of a big line bundle agrees with the Euclidean volume of its Okounkov body. The latter is the convex hull of top rank valuation vectors of sections, all with respect to a single flag. In this text we give a…

This paper focuses on the investigation of volumes of large Coxeter hyperbolic polyhedron. First, the paper investigates the smallest possible volume for a large Coxeter hyperbolic polyhedron and then looks at the volume of pyramids with…

It is a long-standing conjecture that all symplectic capacities which are equal to the Gromov width for ellipsoids coincide on a class of convex domains in $\mathbb{R}^{2n}$. It is known that they coincide for monotone toric domains in all…

In this note, we estimate the upper bound of volume of closed positively or nonnegatively curved Alexandrov space $X$ with strictly convex boundary. We also discuss the equality case. In particular, the Boundary Conjecture holds when the…

The Vapnik-Chervonenkis dimension of a set K in R^n is the maximal dimension of the coordinate cube of a given size, which can be found in coordinate projections of K. We show that the VC dimension of a convex body governs its entropy. This…

We prove the theorem mentioned in the title, for ${\mathbb{R}}^n$, where $n \ge 3$. The case of the simplex was known previously. Also, the case $n=2$ was settled, but there the infimum was some well-defined function of the side lengths. We…

This paper determines the optimal upper bound for the simultaneous packing and covering constants of the two-dimensional centrally symmetric convex domains. It solved a problem opening for more than thirty years.

Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes.…

It is proven that the volume of an infinitesimally flexible polyhedron in $R^3$ is a multiple root of its volume polynomial.