Related papers: Computing shortest closed curves on non-orientable…

Given a graph $G$ cellularly embedded on a surface $\Sigma$ of genus $g$, a cut graph is a subgraph of $G$ such that cutting $\Sigma$ along $G$ yields a topological disk. We provide a fixed parameter tractable approximation scheme for the…

Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which…

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 characteristic $p>0$ and for $q$ a power of $p$, we compute the number of nonplanar rational curves of arbitrary degrees on a smooth Hermitian surface of degree $q+1$ under the assumption that the curves have a parametrization given by…

We describe each multiple curve on the orientable surface of genus-$g$ with $n$ punctures and one boundary component by using this multiple curve's geometric intersection number with the embedded curves in this surface.

We show that if a compact complex surface admits a locally conformally flat metric, then it cannot contain a smooth rational curve of odd self-intersection. In particular, the surface has to be minimal. Then we give a list of possibilities…

We study compact stable embedded minimal surfaces whose boundary is given by two collections of closed smooth Jordan curves in close planes of Euclidean 3-space. Our main result is a classification of these minimal surfaces, under certain…

We consider flat families of reduced curves on a smooth surface S such that each member C has the same number of singularities of fixed singularity types and the corresponding (locally closed) subscheme H of the Hilbert scheme of S. We are…

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\lambda$ be a simplicial map of the complex of curves, $\mathcal{C}(N)$, on $N$ which satisfies the following: $[a]$ and $[b]$ are…

Consider a surface $S$ and let $M\subset S$. If $S\setminus M$ is not connected, then we say $M$ \emph{separates} $S$, and we refer to $M$ as a \emph{separating set} of $S$. If $M$ separates $S$, and no proper subset of $M$ separates $S$,…

We study collections of curves in generic position on a closed surface whose complement consists of one disk only, up to orientation-preserving homeomorphism of the surface. We define a surgery operation on the set of such collections and…

The present paper deals with some characterizations of rectifying and osculating curves on a smooth surface with respect to the reference frame $\{\vec{T},\ \vec{N},\ \vec{T}\times\vec{N}\}$. We have computed the components of position…

This final degree project is devoted to study the topological classification of complex plane curves. These are subsets of $\mathbb{C}^2$ that can be described by an equation $f(x,y)=0$. Loosely speaking, curves are said to be equivalent in…

Many NP-Hard problems on general graphs, such as maximum independence set, maximal cliques and graph coloring can be solved efficiently on chordal graphs. In this paper, we explore the problem of non-separating st-paths defined on edges:…

In this paper, we develop a method to compute the Morse homology of a manifold when descending manifolds and ascending manifolds intersect cleanly, but not necessarily transversely. While obstruction bundle gluing defined by Hutchings and…

Orienting the edges of an undirected graph such that the resulting digraph satisfies some given constraints is a classical problem in graph theory, with multiple algorithmic applications. In particular, an $st$-orientation orients each edge…

We study shortest curves in proximally smooth subsets of a Hilbert space. We consider an $R$-proximally smooth set $A$ in a Hilbert space with points $a$ and $b$ satisfying $\left|{a-b}\right| < 2R.$ We provide a simple geometric algorithm…

Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…

We provide an efficient algorithm to compute the minimum area of a homotopy between two closed plane curves, given that they divide the plane into finite number of regions. For any positive real number $\varepsilon>0$, we construct a closed…

An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise Linear Structure (PLS) isotopic to the original space curve.…