Related papers: On the volume of sections of the cube

We give the sharp lower bound of the volume product of $n$-dimensional convex bodies which are invariant under a discrete subgroup $SO(K)=\{ g \in SO(n); g(K)=K \}$, where $K$ is an $n$-cube or $n$-simplex. This provides new partial results…

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 presents an algorithm to maximize the volume of an affine slice through a given semialgebraic set. This slice-volume task is formulated as an infinite-dimensional linear program in continuous functions, inspired by prior work in…

We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…

We study the problem of existence of regions separating a given amount of volume with the least possible perimeter inside a Euclidean cone. Our main result shows that nonexistence for a given volume implies that the isoperimetric profile of…

We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…

A polygon is \textit{small} if it has unit diameter. The maximal area of a small polygon with a fixed number of sides $n$ is not known when $n$ is even and $n\geq14$. We determine an improved lower bound for the maximal area of a small…

We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time…

We prove a new lower bound for the almost 20 year old problem of determining the smallest possible size of an essential cover of the $n$-dimensional hypercube $\{\pm 1\}^n$, i.e. the smallest possible size of a collection of hyperplanes…

We consider two well-known problems: upper bounding the volume of lower dimensional ellipsoids contained in convex bodies given their John ellipsoid, and lower bounding the volume of ellipsoids containing projections of convex bodies given…

In this paper, we continue the study of intersections of closed curves on translation surfaces, initiated in by S. Cheboui, A. Kessi and D. Massart for a family of arithmetic Veech surfaces and the author, E. Lanneau and D. Massart for a…

Given $n$ integer, let $X$ be either the set of hermitian or real $n\times n$ matrices of rank at least $n-1$. If $n$ is even, we give a sharp estimate on the maximal dimension of a real vector subspace of $X\cup\{0\}$. The rusults are…

A unit cube in $k$ dimensional space (or \emph{$k$-cube} in short) is defined as the Cartesian product $R_1\times R_2\times...\times R_k$ where $R_i$(for $1\leq i\leq k$) is a closed interval of the form $[a_i,a_i+1]$ on the real line. A…

We study convex sets C of finite (but non-zero volume in Hn and En. We show that the intersection of any such set with the ideal boundary of Hn has Minkowski (and thus Hausdorff) dimension of at most (n-1)/2, and this bound is sharp. In the…

The Mahler volume of a centrally symmetric convex body K is defined as M(K)= (Vol K)(Vol K^dual). Mahler conjectured that this volume is minimized when K is a cube. We introduce the bottleneck conjecture, which stipulates that a certain…

Let $K$ be a convex body in $\mathbb R^n$. We prove that in small codimensions, the sections of a convex body through the centroid are quite symmetric with respect to volume. As a consequence of our estimates we give a positive answer to a…

We establish some bounds on the number of higher-dimensional partitions by volume. In particular, we give bounds via vector partitions and MacMahon's numbers.

We introduce a definition of the volume for a general rectangular matrix, which for square matrices is equivalent to the absolute value of the determinant. We generalize results for square maximum-volume submatrices to the case of…

Motivated by modern applications like image processing and wireless sensor networks, we consider a variation of the famous Kepler Conjecture. Given any infinite set of unit balls covering the whole space, we want to know the optimal (lim…

We establish a general formula for the enclosed volume of constant mean curvature (CMC) surfaces in Euclidean three space with translational periods forming a lattice. The formula relates the volume to the surface area, a…