Related papers: Measuring complexity of curves on surfaces

For a fixed radius $r$ and a point $o$ in the curve complex of a surface, we define the sphere of radius $r$ to be the induced subgraph on the set of vertices of distance $r$ from $o$. We show that these spheres are almost simply connected…

We consider ruled surfaces with finite multiplicity. We study behaviors of the striction curves and the singularities of the ruled surfaces. We also give geometric meanings of invariants related to the ruled surfaces.

This work introduces a complexity measure which addresses some conflicting issues between existing ones by using a new principle - measuring the average amount of symmetry broken by an object. It attributes low (although different)…

We first study symplectically embedded curves in symplectic surfaces with high self-intersection numbers compared to their genus. We prove in two different ways that such a curve completely determines both the diffeomorphism type of the…

Let $\gamma$ be a generic closed curve in the plane. Samuel Blank, in his 1967 Ph.D. thesis, determined if $\gamma$ is self-overlapping by geometrically constructing a combinatorial word from $\gamma$. More recently, Zipei Nie, in an…

In this thesis, we present various contributions to the study of free boundary minimal surfaces. After introducing some basic tools and discussing some delicate aspects related to the definition of Morse index when allowing for a contact…

With a view to study problems of smoothability, we construct a minimal free resolution for the coordinate ring of an algebroid monomial curve associated to an $AS$ numerical semigroup (i.e. generated by an arithmetic sequence), obtained…

We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…

Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…

Given two closed curves in a surface, we propose an algorithm to detect whether they are of the same type or not.

For various purposes and, in particular, in the context of data compression, a graph can be examined at three levels. Its structure can be described as the unlabeled version of the graph; then the labeling of its structure can be added; and…

We prove a lower bound for the topological complexity, in the sense of Smale, of the problem of finding a flex point on a cubic plane curve. The key is to bound the Schwarz genus of a cover associated to this problem. We also show that our…

Let $\Sigma$ be a surface with either boundary or marked points, equipped with an arbitrary framing. In this note we determine the action of the associated "framed mapping class group" on the homology of $\Sigma$ relative to its boundary…

Let $ G $ be a connected graph. If $\bar{\sigma}(v)$ denotes the arithmetic mean of the distances from $v$ to all other vertices of $G$, then the proximity, $\pi(G)$, of $G$ is defined as the smallest value of $\bar{\sigma}(v)$ over all…

We classify the singular loci of real surfaces in three-space that contain two circles through each point. We characterize how a circle in such a surface meets this loci as it moves in its pencil and as such provide insight into the…

Gay and Kirby introduced trisections which describe any closed oriented smooth 4-manifold $X$ as a union of three four-dimensional handlebodies. A trisection is encoded in a diagram, namely three collections of curves in a closed oriented…

Many classical results in algebraic geometry arise from investigating some extremal behaviors that appear among projective varieties not lying on any hypersurface of fixed degree. We study two numerical invariants attached to such…

This paper examines the relationship between the knotting of an embedded surface in $\R^3$ and the knotting of its fold curves, formed by the singular set of projection to a plane. The first result shows that every surface, no matter how…

We prove necessary and sufficient conditions for a smooth surface in a 4-manifold X to be pseudoholomorphic with respect to some almost complex structure on X. This provides a systematic approach to the construction of pseudoholomorphic…

Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…