Related papers: Origami edge-paths in the curve graph

The main objects of the paper are $z$-oriented triangulations of connected closed $2$-dimensional surfaces. A $z$-orientation of a map is a minimal collection of zigzags which double covers the set of edges. We have two possibilities for an…

We introduce a simple and concrete way of visualizing in three dimensions a "flat" Klein bottle -- one whose local intrinsic geometry is the same as that of a flat plane -- which preserves most its topological and geometric structure.…

Let $S_g$ be a closed orientable surface of genus $g\geq 2$. A collection $\Omega = \{ \gamma_1, \dots, \gamma_s\}$ of pairwise non-homotopic simple closed curves on $S_g$ such that $\gamma_i$ and $\gamma_j$ are in minimal position, is…

The paper presents two edge grouping algorithms for finding a closed contour starting from a particular edge point and enclosing a fixation point. Both algorithms search a shortest simple cycle in \textit{an angularly ordered graph} derived…

Origami and crumpling are two extreme tools to shrink a 3-D shell. In the shrink/expand process, the former is reversible due to its topological mechanism, while the latter is irreversible because of its random-generated creases. We observe…

A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…

A shortest-path algorithm finds a path containing the minimal cost between two vertices in a graph. A plethora of shortest-path algorithms is studied in the literature that span across multiple disciplines. This paper presents a survey of…

In this paper, we continue the study of the Hamiltonian and longest $(s, t)$-paths of supergrid graphs. The Hamiltonian $(s, t)$-path of a graph is a Hamiltonian path between any two given vertices $s$ and $t$ in the graph, and the longest…

A quad-mesh rigid origami is a continuously deformable panel-hinge structure where planar, rigid, zero-thickness quadrilateral panels are connected by rotational hinges in the combinatorics of a grid. This article provides a comprehensive…

We show that, for each $n>0$, there is a family of elliptic surfaces which are covered by the square of a curve of genus $2n+1$, and whose Hodge structures have an action by ${\mathbb Q}(\sqrt{-n})$. By considering the case $n=3$, we show…

We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…

We present some algorithms that provide useful topological information about curves in surfaces. One of the main algorithms computes the geometric intersection number of two properly embedded 1-manifolds $C_1$ and $C_2$ in a compact…

In this paper we study maps (curved flats) into symmetric spaces which are tangent at each point to a flat of the symmetric space. Important examples of such maps arise from isometric immersions of space forms into space forms via their…

We prove that on a closed surface of genus $g$, the cardinality of a set of simple closed curves in which any two are non-homotopic and intersect at most once is $\lesssim g^2 \log(g)$. This bound matches the largest known constructions to…

A plane curve $C$ in $\mathbb{P}^2$ defined over $\mathbb{F}_q$ is called plane-filling if $C$ contains every $\mathbb{F}_q$-point of $\mathbb{P}^2$. Homma and Kim, building on the work of Tallini, proved that the minimum degree of a smooth…

This paper is devoted to the study of isometrically homogeneous spaces from the view point of metric geometry. Mainly we focus on those spaces that are homeomorphic to lines. One can reduce the study to those distances on $\R$ that are…

A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that…

A geometric graph $G$ is $xy-$monotone if each pair of vertices of $G$ is connected by a $xy-$monotone path. We study the problem of producing the $xy-$monotone spanning geometric graph of a point set $P$ that (i) has the minimum cost,…

A path in an edge-colored graph is called proper if no two consecutive edges of the path receive the same color. For a connected graph $G$, the proper connection number $pc(G)$ of $G$ is defined as the minimum number of colors needed to…