Related papers: On contractible edges in convex decompositions

Several characterizations of complex ellipsoids among convex bodies in Cn, in terms of their sections and projections are proved. Characterizing complex symmetry in similar terms is an important tool.

Let $G$ be a u.s.c decomposition of $S^n$, $H_G$ denote the set of nondegenerate elements and $\pi$ be the projection of $S^n$ onto $S^n/G$. Suppose that each point in the decomposition space has arbitrarily small neighborhoods with…

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.

Sets of three types of convex pentagons that are aperiodic with no matching conditions on the edges are created from a chiral aperiodic monotile Tile(1, 1). This method divides the interior of Tile(1,1) into five convex polygons with five…

A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…

We describe some properties of noncompact Euclidean cone manifolds with cone angles less than c less than 2pi and singular locus a submanifold. More precisely, we describe its structure outside a compact set. As a corollary we classify…

Let $K$ be a planar convex body af area $|K|$, and take $0 \textless{} \alpha \textless{} 1$.An $\alpha$-section of $K$ is a line cutting $K$ into two parts, one of whichhas area $\alpha|K|$. This article presents a systematic study of the…

Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…

This paper discusses a more general contractive condition for a class of extended cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same…

Any two polygons of equal area can be partitioned into congruent sets of polygonal pieces, and in many cases one can connect the pieces by flexible hinges while still allowing the connected set to form both polygons. However it is open…

The deviation of a general convex body with twice differentiable boundary and an arbitrarily positioned polytope with a given number of vertices is studied. The paper considers the case where the deviation is measured in terms of the…

We determine which connected surfaces can be partitioned into topological circles. There are exactly seven such surfaces up to homeomorphism: those of finite type, of Euler characteristic zero, and with compact boundary components. As a…

There is a conjecture that a complete Riemannian 3-manifold with bounded sectional curvature, and pointwise pinched nonnegative Ricci curvature, must be flat or compact. We show that this is true when the negative part (if any) of the…

We classify static manifolds which admit more than one static decomposition whenever a condition on the curvature is fullfilled. For this, we take a standard static vector field and analyze its associated one parameter family of projections…

Congruent polygons are congruent in angles as well as in edge lengths. We concentrate on the angle aspect, and investigate how tilings of the sphere by congruent pentagons can be determined by the angle information only. We also investigate…

Given a set $P$ of $n$ points in the plane, its unit-disk graph $G(P)$ is a graph with $P$ as its vertex set such that two points of $P$ are connected by an edge if their (Euclidean) distance is at most $1$. We consider several classical…

We characterize the polytopes in $\mathbb{R}^d$ (not necessarily convex or connected ones) which multi-tile the space by translations along a given lattice. We also give a necessary and sufficient condition for two polytopes in…

We consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment is stabbed by a simple polygon $\mathcal{P}$ if at least one of its two endpoints is contained in $\mathcal{P}$. A segment set $S$ is…

We call a continuous path of polygons decreasing if the convex hulls of the polygons form a decreasing family of sets. For an arbitrary polygon of more than three vertices, we characterize the polygons contained in it that can be reached by…

Ghomi proved that every convex polyhedron could be stretched via an affine transformation so that it has an edge-unfolding to a net [Gho14]. A net is a simple planar polygon; in particular, it does not self-overlap. One can view his result…