Related papers: Reconstructing a Polyhedron between Polygons in Pa…
Any simple planar graph can be triangulated, i.e., we can add edges to it, without adding multi-edges, such that the result is planar and all faces are triangles. In this paper, we study the problem of triangulating a planar graph without…
We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…
Let $S$ be a parametric surface in $\proj{3}$ given as the image of $\phi: \proj{1} \times \proj{1} \to \proj{3}$. This paper will show that the use of syzygies in the form of a combination of moving planes and moving quadrics provides a…
In this paper we establish the existence of monads on Cartesian products of projective spaces. We construct vector bundles associated to monads on…
Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation is a full triangulation of some subset P' of P containing all extreme points in…
In this paper, we will construct an example of a closed Riemann surface $X$ that can be realized as a quotient of a triply periodic polyhedral surface $\Pi \subset \mathbb{R}^3$ where the Weierstrass points of $X$ coincide with the vertices…
We study hyperbolic polyhedral surfaces with faces isometric to regular hyperbolic polygons satisfying that the total angles at vertices are at least $2\pi.$ The combinatorial information of these surfaces is shown to be identified with…
Consider the map $S$ which sends a planar polygon $P$ to a new polygon $S(P)$ whose vertices are the intersection points of second nearest sides of $P$. This map is the inverse of the famous pentagram map. In this paper we investigate the…
When two monolayers of graphene are stacked with a small relative twist angle, the resulting band structure exhibits a remarkably flat pair of bands at a sequence of 'magic angles' where correlation effects can induce a host of exotic…
We give a new proof of Steinitz's classical theorem in the case of plane triangulations, which allows us to obtain a new general bound on the grid size of the simplicial polytope realizing a given triangulation, subexponential in a number…
In this article, we propose a new approach for describing and understanding knots and links in a 3-manifold through the use of an embedded non-orientable surface. Specifically, we define a plat-like representation based on this…
Motivated by the indications of high-Tc superconductivity in natural graphite enriched in the rhombohedral phase, we study the band structure of several stacking configurations that combine two of the three graphite structures as well as…
We show that the max-min-angle polygon in a planar point set can be found in time $O(n\log n)$ and a max-min-solid-angle convex polyhedron in a three-dimensional point set can be found in time $O(n^2)$. We also study the maxmin-angle…
We announce results about flat (linkless) embeddings of graphs in 3-space. A piecewise-linear embedding of a graph in 3-space is called {\it flat} if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have…
The transition between gapped (semiconducting) and gapless (metallic) phases and tunability of bandgap in materials is a very lucrative yet considerably challenging goal for new-age device preparation. For bulk materials and for…
We consider the moduli space of bordered Riemann surfaces with boundary and marked points. Such spaces appear in open-closed string theory, particularly with respect to holomorphic curves with Lagrangian submanifolds. We consider a…
We study closed smooth convex plane curves $\Gamma$ enjoying the following property: a pair of points $x,y$ can traverse $\Gamma$ so that the distances between $x$ and $y$ along the curve and in the ambient plane do not change; such curves…
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a *net*, a connected planar piece with no overlaps. A *grid unfolding* allows additional cuts along grid edges induced by coordinate planes…
In this paper, we deal with the question; under what conditions the points $P_i(xi,yi)$ $(i = 1,\cdots, n)$ form a convex polygon provided $x_1 < \cdots < x_n$ holds. One of the main findings of the paper can be stated as follows: "Let…
In the Planar Disjoint Paths problem, one is given an undirected planar graph with a set of $k$ vertex pairs $(s_i,t_i)$ and the task is to find $k$ pairwise vertex-disjoint paths such that the $i$-th path connects $s_i$ to $t_i$. We study…