Related papers: Volume of Hypercubes Clipped by Hyperplanes and Co…
Given a vector a $\in$ Rn, we provide an alternative and direct proof for the formula of the volume of sections delta $\cap$ {x : a T x \textless{}= t} and slices $\cap$ {x : a T x = t}, t $\in$ R, of the simplex delta. For slices the…
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…
In a variety of settings we provide a method for decomposing a 3-manifold $M$ into pieces. When the pieces have the appropriate type of hyperbolicity, then the manifold $M$ is hyperbolic and its volume is bounded below by the sum of the…
Volume of metric balls relates to rate-distortion theory and packing bounds on codes. In this paper, the volume of balls in complex Grassmann manifolds is evaluated for an arbitrary radius. The ball is defined as a set of hyperplanes of a…
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…
We study the supremum of the volume of hyperbolic polyhedra with some fixed combinatorics and with vertices of any kind (real, ideal or hyperideal). We find that the supremum is always equal to the volume of the rectification of the…
The manuscript provides formulas for the volume of a body defined by the intersection of a solid cone and a solid sphere as a function of the sphere radius, of the distance between cone apex and sphere center, and of the cone aperture…
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 partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n…
How many hyperplanes in $\mathbb{R}^n$ are needed in order to slice every edge of the $n$-dimensional hypercube with vertex set $\{\pm 1\}^n$? Here, we say that a hyperplane $H\subseteq \mathbb{R}^n$ slices an edge of the hypercube if it…
Closed form expressions are given for computing the parameters and vectors that identify and define the $n-1$ dimensional conic section that results from the intersection of a hyperplane with an $n$-dimensional conic section: cone,…
In this paper, we present a new explicit formula for the curvatures of a regular curve with an arbitrary parameter in the Euclidean space $\mathbb{R}^n$, $n\geq 2$, expressed only in terms of its derivatives. We introduce also the notion of…
In a previous work arXiv:physics/0611108v2, it was shown that the volume spanned by a molecular system in its conformational space can be effectively bounded by a polyhedral cone, this cone is described by means of a simple combinatorial…
It is shown that the volume entropy of a Hilbert geometry associated to an $n$-dimensional convex body of class $C^{1,1}$ equals $n-1$. To achieve this result, a new projective invariant of convex bodies, similar to the centro-affine area,…
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.…
The present paper regards the volume function of a doubly truncated hyperbolic tetrahedron. Starting from the previous results of J. Murakami, U. Yano and A. Ushijima, we have developed a unified approach to express the volume in different…
We study the dual variants of the Erd\H{o}s's distinct distances and unit distance problems. Instead of considering distances determined by points, we consider simplex volumes determined by hyperplanes. We investigate: (1) the maximum…
Various authors have calculated how many pairwise incomparable points can be selected from a partially ordered set. We tackle this question for the family of subsets of a finite set obtained by removing or adding a bounded number of…
Volume is a natural measure of complexity of a Riemannian manifold. In this survey, we discuss the results and conjectures concerning n-dimensional hyperbolic manifolds and orbifolds of small volume.
In this paper an explicit formula for a lower bound on the volume of a hyperbolic orbifold, dependent on dimension and the maximal order of torsion in the orbifolds' fundamental group, is constructed.