Related papers: Partitioning the projective plane and the dunce ha…

We present a concise proof for the supporting hyperplane theorem. We then observe that the proof not only establishes the supporting hyperplane theorem but also extends it to a hyperplane separation theorem for certain non-convex sets. The…

We envision programmable matter as a system of nano-scale agents (called particles) with very limited computational capabilities that move and compute collectively to achieve a desired goal. We use the geometric amoebot model as our…

We prove that octants are cover-decomposable into multiple coverings, i.e., for any k there is an m(k) such that any m(k)-fold covering of any subset of the space with a finite number of translates of a given octant can be decomposed into k…

Plant differently colored points in the plane, then let random points ("Poisson rain") fall, and give each new point the color of the nearest existing point. Previous investigation and simulations strongly suggest that the colored regions…

A triangulation of a punctured or pinched surface is irreducible if no edge can be shrunk without producing multiple edges or changing the topological type of the surface. The finiteness of the set of (non-isomorphic) irreducible…

We study non-compact surfaces obtained by gluing strips $\mathbb{R}\times(-1,1)$ with at most countably many boundary intervals along some these intervals. Every such strip possesses a foliation by parallel lines, which gives a foliation on…

Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.

We consider a class of cut-and-project sets $\Lambda = \Lambda_F \times \zahl$ in the plane. Let $L=\Lambda+w\real$, $w\in\real^2$, be a countable union of parallel lines. Then either (1) $L$ is a discrete family of lines, (2) $L$ is a…

Following our previous work, we develop an algorithm to compute a presentation of the fundamental group of certain partial compactifications of the complement of a complex arrangement of lines in the projective plane. It applies, in…

We generalise the techniques of semistable reduction for flat families of sheaves to the setting of the derived category $D^b(X)$ of coherent sheaves on a smooth projective three-fold $X$. Then we construct the moduli of PT-semistable…

Floor-planning is a fundamental step in VLSI chip design. Based upon the concept of orderly spanning trees, we present a simple O(n)-time algorithm to construct a floor-plan for any n-node plane triangulation. In comparison with previous…

Motivated by a question of R.\ Nandakumar, we show that the Euclidean plane can be dissected into mutually incongruent convex pentagons of the same area and the same perimeter.

Separation logic adds two connectives to assertion languages: separating conjunction * ("star") and its adjoint, separating implication -* ("magic wand"). Comparatively, separating implication is less widely used. This paper demonstrates…

In this paper, we study simplicial hyperplane arrangements in real projective $3$-space. We give a necessary condition for the characteristic polynomial to have only real roots, valid also for non-simplicial arrangements. As application, we…

The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…

We study a class of geometric covering and packing problems for bounded regions on the plane. We are given a set of axis-parallel line segments that induces a planar subdivision with a set of bounded (rectilinear) faces. We are interested…

We give a criterion for a projective surface to become a quotient of a fake projective plane. We also give a detailed information on the elliptic fibration of a $(2,3)$-elliptic surface that is the minimal resolution of a quotient of a fake…

Writing correct distributed programs is hard. In spite of extensive testing and debugging, software faults persist even in commercial grade software. Many distributed systems, especially those employed in safety-critical environments,…

Separation logic and its variants can describe various properties on pointer programs. However, when it comes to properties on sequences, one may find it hard to formalize. To deal with properties on variable-length sequences and multilevel…