Related papers: On Viviani's Theorem and its Extensions

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

Let $X$ be a subset of a Hilbert space. We prove that if $v\colon X\to \mathbb{R}^m$ is such that \begin{equation*} \Big\lVert v(x)-\sum_{i=1}^m t_iv(x_i)\Big\rVert\leq \Big\lVert x-\sum_{i=1}^m t_ix_i\Big\rVert \end{equation*} for all…

Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.

We show that the theorem of the three perpendiculars holds in any n-dimensional space form.

An n-gon is defined as a sequence \P=(V_0,...,V_{n-1}) of n points on the plane. An n-gon \P is said to be convex if the boundary of the convex hull of the set {V_0,...,V_{n-1}} of the vertices of \P coincides with the union of the edges…

Minkowski's Theorem asserts that every centered measure on the sphere which is not concentrated on a great subsphere is the surface area measure of some convex body, and, moreover, the surface area measure determines a convex body uniquely.…

We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…

Consider a measurable space with a finite vector measure. This measure defines a mapping of the $\sigma$-field into a Euclidean space. According to Lyapunov's convexity theorem, the range of this mapping is compact and, if the measure is…

The main goal of this paper is to present a series of inequalities connecting the surface area measure of a convex body and surface area measure of its projections and sections. We present a solution of a question from S. Campi, P.…

Torelli's theorem is proven by the study of the convolution product of the intersection cohomology sheaf of the thetadivisor.

We show that if a disc triangulation has all internal vertex degrees at least 6, then the full triangulation may be determined from the pairwise graph distance between boundary vertices. A similar result holds for quadrangulations with all…

Edwards' Theorem establishes duality between a convex cone in the space of continuous functions on a compact space and the set of representing or Jensen measures for this cone. In this paper we prove non-compact versions of this theorem.

A real vector space combined with an inverse for vectors is sufficient to define a vector continued fraction whose parameters consist of vector shifts and changes of scale. The choice of sign for different components of the vector inverse…

We state that any constant curvature Riemannian metric with conical singularities of constant sign curvature on a compact (orientable) surface $S$ can be realized as a convex polyhedron in a Riemannian or Lorentzian) space-form. Moreover…

A set of vertices X of a graph G is convex if it contains all vertices on shortest paths between vertices of X. We prove that for fixed p, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial…

We prove that the number of dissections of a given polygon into triangles with fixed areas of faces is finite and that an equidissection is algebraic as long as the vertices of the original polygon have algebraic coordinates.

In theory of one complex variable, Gauss-Lucas Theorem states that the critical points of a non constant polynomial belong to the convex hull of the set of zeros of the polynomial. The exact analogue of this result cannot hold, in general,…

The Gauss-Bonnet theorem for a polyhedron (a union of finitely many compact convex polytopes) in $n$-dimensional Euclidean space expresses the Euler characteristic of the polyhedron as a sum of certain curvatures, which are different from…

We provide a new proof of the elementary geometric theorem on the existence and uniqueness of cyclic polygons with prescribed side lengths. The proof is based on a variational principle involving the central angles of the polygon as…

We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…