Related papers: On a Simplex Inscribed in a Ball

We investigate the asymptotic best approximation of a smooth, strictly convex body $K$ in $\mathbb{R}^d$ by inscribed polytopes with a restricted number of vertices under the intrinsic volume difference. We prove rigidity phenomena in both…

We prove that there exists a unique ellipse of minimal eccentricity, E_{I}, inscribed in a parallelogram, D. We also prove that the smallest nonnegative angle between equal conjugate diameters of E_{I} equals the smallest nonnegative angle…

Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…

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…

Some geometric facts concerning sets with positive reach in the Euclidean $d$-dimensional space ${\bf E}^d$ are proved. For $x_1$ and $x_2$ in ${\bf E}^d$ and $R>0$ let us denote by ${\mathfrak H}(x_1,x_2,R)$ the intersection of all closed…

Given a natural number $n\geq3$ and two points $a$ and $b$ in the unit disk $\mathbb D$ in the complex plane, it is known that there exists a unique elliptical disk having $a$ and $b$ as foci that can also be realized as the intersection of…

We prove that an m-dimensional unit ball D^m in the Euclidean space {\mathbb R}^m cannot be isometrically embedded into a higher-dimensional Euclidean ball B_r^d \subset {\mathbb R}^d of radius r < 1/2 unless one of two conditions is met --…

In this work, it is shown that if $A$ is an $n$-by-$n$ convexoid matrix (i.e., its field of values coincides with the convex hull of its eigenvalues), then the field of any $(n-1)$-by-$(n-1)$ principal submatrix of $A$ is inscribed in the…

A spherical set is called convex if for every pair of its points there is at least one minimal geodesic segment that joins these points and lies in the set. We prove that for n >= 3 a complete locally-convex (topological) immersion of a…

Barthe proved that the regular simplex maximizes the mean width of convex bodies whose John ellipsoid (maximal volume ellipsoid contained in the body) is the Euclidean unit ball; or equivalently, the regular simplex maximizes the…

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…

This article deals with the existence of hypersurfaces minimizing general shape functionals under certain geometric constraints. We consider as admissible shapes orientable hypersurfaces satisfying a so-called reach condition, also known as…

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

Approximating convex bodies is a fundamental problem in geometry. Given a convex body $K$ in $\mathbb{R}^d$ for a fixed dimension $d$, the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff…

Equifacetal simplices, all of whose codimension one faces are congruent to one another, are studied. It is shown that the isometry group of such a simplex acts transitively on its set of vertices, and, as an application, equifacetal…

Theorem A. Let $M^n$ denote a closed Riemannian manifold with nonpositive sectional curvature and let $\tilde M^n$ be the universal cover of $M^n$ with the lifted metric. Suppose that the universal cover $\tilde M^n$ contains no totally…

In this work we prove the following result: Let $K$ be a strictly convex body in the Euclidean space $\mathbb{R}^n, n\geq 3$, and let $L$ be a hypersurface, which is the image of an embedding of the sphere $\mathbb{S}^{n-1}$, such that $K$…

The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. The underlying procedure is the enumeration of admissible vertices of a high-dimensional polytope, where admissibility is a powerful but…

Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…

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…