Related papers: Minimal Paths on Some Simple Surfaces with Singula…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…
Let S be a set of distinct points in general position in the Euclidean plane. A plane Hamiltonian path on S is a crossing-free geometric path such that every point of S is a vertex of the path. It is known that, if S is sufficiently large,…
We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $\mathcal{P}=\{P_{u,v}|u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices…
We consider the problem of determining the length of the shortest paths between points on the surfaces of tetrahedra and cubes. Our approach parallels the concept of Alexandrov's star unfolding but focuses on specific polyhedra and uses…
A \emph{simple} $s,t$ path $P$ in a rectangular grid graph $\mathbb{G}$ is a Hamiltonian path from the top-left corner $s$ to the bottom-right corner $t$ such that each \emph{internal} subpath of $P$ with both endpoints $a$ and $b$ on the…
Simplicial identities play an important and fundamental role in simplicial homotopy theory. On the other hand, the study of the paths and the regular paths on discrete sets is the foundation for the path-homology theory of digraphs. In this…
A methodology is developed for data analysis based on empirically constructed geodesic metric spaces. For a probability distribution, the length along a path between two points can be defined as the amount of probability mass accumulated…
We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…
We consider the trajectories of points on $\mathbb{S}^{d - 1}$ under sequences of certain folding maps associated with reflections. The main result characterizes collections of folding maps that produce dense trajectories. The minimal…
A triangulated piecewise-linear minimal surface in Euclidean 3-space defined using a variational characterization is critical for area amongst all continuous piecewise-linear variations with compact support that preserve the simplicial…
We introduce a new complexity measure of a path of (problems, solutions) pairs in terms of the length of the path in the condition metric which we define in the article. The measure gives an upper bound for the number of Newton steps…
By employing the method of moving planes in a novel way we extend some classical symmetry and rigidity results for smooth minimal surfaces to surfaces that have singularities of the sort typically observed in soap films.
We uncover some connections between the topology of a complete Riemannian surface M and the minimum number of vertices, i.e., critical points of geodesic curvature, of closed curves in M. In particular we show that the space forms with…
An {\sf oriented perfect path double cover} ($\rm OPPDC$) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each edge of $G_s$ lies in exactly one of the paths and each vertex of $G$…
Some problems founds in teaching physics related to curved paths that are unfortunately only described as illustration. A simple way to introduce the path is presented, which can help students to test their concept numerically. The…
By means of filters, minimal R_1 and minimal regular topologies are characterized on suitable intervals consisting of non-trivial R_0 topologies.
For generic maps from compact surfaces with boundary into the plane we develop an explicit algorithm for minimizing both the number of cusps and the number of components of the singular locus. More precisely, we minimize among maps with…
In this article we prove that for a large class of 2-dimensional minimal cones (including almost all 2-dimensional minimal cones that we know), the almost orthogonal union of any two of them is still a minimal cone. Comparing to existing…
We consider the following questions: given a hyperbolic plane domain and a separation of its complement into two disjoint closed sets each of which contains at least two points, what is the shortest closed hyperbolic geodesic which…
In this short note we give and discuss a general multilinear expression of the structure function of an arbitrary semicoherent system in terms of its minimal path and cut sets. We also examine the link between the number of minimal path and…