Related papers: An extremal problem of regular simplices-The highe…

Let a random simplex in a d-dimensional convex body be the convex hull of d+1 random points from the body. We study the following question: As a function of the convex body, is the expected volume of a random simplex monotone non-decreasing…

A three-dimensional orthoscheme is defined as a tetrahedron whose base is a right-angled triangle and an edge joining the apex and a non-right-angled vertex is perpendicular to the base. A generalization, called complete orthoschemes, of…

The simplex was conjectured to be the extremal convex body for the two following "problems of asymmetry":\\ P1) What is the minimal possible value of the quantity $\max_{K'} |K'|/|K|$? Here, $K'$ ranges over all symmetric convex bodies…

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in general position in \R^d is contained in at least (d+1)^2/2 simplices with one vertex from each set. This improves the known lower bounds for all d >= 4.

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 consider the following problem: Given a point set in space find a largest subset that is in convex position and whose convex hull is empty. We show that the (decision version of the) problem is W[1]-hard.

We prove an exponential deviation inequality for the convex hull of a finite sample of i.i.d. random points with a density supported on an arbitrary convex body in $\R^d$, $d\geq 2$. When the density is uniform, our result yields rate…

We investigate lower bounds for the number of ideal and finite vertices of right-angled hyperbolic polyhedra of finite volume. We use a geometric method of orthogonal gluings to establish new bounds in low dimensions, specifically…

We consider a compact hyperbolic tetrahedron of a general type. It is a convex hull of four points called vertices in the hyperbolic space $\mathbb{H}^3$. It can be determined by the set of six edge lengths up to isometry. For further…

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…

We address the question of which convex shapes, when packed as densely as possible under certain restrictions, fill the least space and leave the most empty space. In each different dimension and under each different set of restrictions,…

We prove, in the case of hyperbolic 3-space, a couple of conjectures raised by J. J. Seidel in "On the volume of a hyperbolic simplex", Stud. Sci. Math. Hung. 21, 243-249, 1986. These conjectures concern expressing the volume of an ideal…

The present work surveys problems in $n$-dimensional space with $n$ large. Early development in the study of packing and covering in high dimensions was motivated by the geometry of numbers. Subsequent results, such as the discovery of 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…

This paper investigates the relationship between the topology of hyperbolizable 3-manifolds M with incompressible boundary and the volume of hyperbolic convex cores homotopy equivalent to M. Specifically, it proves a conjecture of Bonahon…

For a compact right-angled polyhedron $R$ in $\mathbb H^3$ denote by $\operatorname{vol} (R)$ the volume and by $\operatorname{vert} (R)$ the number of vertices. Upper and lower bounds for $\operatorname{vol} (R)$ in terms of…

In this paper we deal with problems concerning the volume of the convex hull of two "connecting" bodies. After a historical background we collect some results, methods and open problems, respectively.

In this paper, we extend and generalize several previous works on maximal-volume positions of convex bodies. First, we analyze the maximal positive-definite image of one convex body inside another, and the resulting decomposition of the…

Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…

In this paper, we study the problem of hyperball (hypersphere) packings in $n$-dimensional hyperbolic space ($n \ge 4$). We prove that to each $n$-dimensional congruent saturated hyperball packing, there is an algorithm to obtain a…