Related papers: On the volume of hyperplane sections of a d-cube
We study the properties of the maximal volume $k$-dimensional sections of the $n$-dimensional cube $[-1,1]^n$. We obtain a first order necessary condition for a $k$-dimensional subspace to be a local maximizer of the volume of such…
Let $Q_n$ be the cube of side length one centered at the origin in $\mathbb{R}^n$, and let $F$ be an affine $(n-d)$-dimensional subspace of $\mathbb{R}^n$ having distance to the origin less than or equal to $\frac 1 2$, where $0<d<n$. We…
We state a general formula to compute the volume of the intersection of the regular $n$-simplex with some $k$-dimensional subspace. It is known that for central hyperplanes the one through the centroid containing $n-1$ vertices gives the…
We provide a formula to compute the volume of the intersection of a generalized cylinder with a hyperplane. Then we prove an integral inequality involving Bessel functions similar to Keith Ball's well-known inequality. Using this inequality…
Consider the hyperplanes at a fixed distance $t$ from the center of the hypercube $[0,1]^d$. Significant attention has been given to determining the hyperplanes $H$ among these such that the $(d-1)$-dimensional volume of $H\cap[0,1]^d$ is…
We prove that the volume of central hyperplane sections of a unit cube in $\mathbb{R}^n$ orthogonal to a diameter of the cube is a strictly monotonically increasing function of the dimension for $n\geq 3$. Our argument uses an integral…
Ball's celebrated cube slicing (1986) asserts that among hyperplane sections of the cube in $\mathbb{R}^n$, the central section orthogonal to $(1,1,0,\dots,0)$ has the greatest volume. We show that the same continues to hold for slicing…
We determine the maximal hyperplane sections of the regular $n$-simplex, if the distance of the hyperplane to the centroid is fairly large, i.e. larger than the distance of the centroid to the midpoint of edges. Similar results for the…
We find an optimal upper bound on the volume of the John ellipsoid of a $k$-dimensional section of the $n$-dimensional cube, and an optimal lower bound on the volume of the L\"owner ellipsoid of a projection of the $n$-dimensional…
In many cosmological models, including the $\Lambda$CDM concordance model, there exist a theoretical upper bounds on the size of collapsing structures. The most common formulations in the literature refer to a turnaround radius in spherical…
Consider a $d$-dimensional closed ball $B$ whose center coincides with that of the hypercube $[0,1]^d$. Pick the radius of $B$ in such a way that the vertices of the hypercube are outside of $B$ and the midpoints of its edges in the…
In this article we prove a conjecture of Bezdek, Brass, and Harborth concerning the maximum volume of the convex hull of any facet-to-facet connected system of n unit hypercubes in the d-dimensional Euclidean space. For d=2 we enumerate the…
In this paper we give lower and upper bounds for the volume growth of a regular hyperbolic simplex, namely for the ratio of the $n$-dimensional volume of a regular simplex and the $(n-1)$-dimensional volume of its facets. In addition to the…
Let $\Delta_n$ and $Q_n$ denote the regular $n$-simplex of side length $\sqrt{2}$ embedded in $\mathbb{R}^{n+1}$ and the volume one cube in $\mathbb{R}^n$, respectively. We derive a closed-form formula for the hyperplane volume projections…
The new result of this paper connected with the following problem: Consider a supporting hyperplane of a regular simplex and its re ected image at this hyperplane. When will be the volume of the convex hull of these two simplices maximal?…
Consider a non-negative number $t$ and a hyperplane $H$ of $\mathbb{R}^d$ whose distance to the center of the hypercube $[0,1]^d$ is $t$. If $t$ is equal to $0$ and $H$ is orthogonal to a diagonal of $[0,1]^d$, it is known that the…
We study the $(n-1)$-dimensional volume of central hyperplane sections of the $n$-dimensional cube $Q_n$. Our main goal is two-fold: first, we provide an alternative, simpler argument for proving that the volume of the section perpendicular…
We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…
We find minimal and maximal length of intersections of lines at a fixed distance to the origin with the cross-polytope. We also find maximal volume noncentral sections of the cross-polypote by hyperplanes which are at a fixed large distance…
Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of the n-dimensional hypercube {0,1}^n except the origin.…