arXiv research

Study describes Morse flows on a torus with up to six singular points.

Study describes bifurcations of gradient flows on 2-sphere with holes.

Square-tiled surfaces can be classified by their number of squares and their cylinder diagrams (also called realizable separatrix diagrams). For the case of $n$ squares and two cone points with angle $4 π$ each, we set up and parametrize the classification into four diagrams. Our main result is to provide formulae for …

Study of separatrix configurations in holomorphic flows with real time.

We address some global solvability issues for classes of smooth nonsingular vector fields $L$ in the plane related to cohomological equations $Lu=f$ in geometry and dynamical systems. The first main result is that $L$ is not surjective in $C^\infty(\R^2)$ iff the geometrical condition -- the existence of separatrix str…

We propose a new condition $\aleph$ which enables to get new results on integrable geodesic flows on closed surfaces. This paper has two parts. In the first, we strengthen Kozlov's theorem on non-integrability on surfaces of higher genus. In the second, we study integrable geodesic flows on 2-torus. Our main result for…

Study on connection points on double regular polygons, providing coordinates and proving non-connection points.

We study framed translation surfaces corresponding to meromorphic differentials on compact Riemann surfaces, for which a horizontal separatrix is marked for each pole or zero. Such geometric structures naturally appear when studying flat geometry surfaces "near" the Deligne-Mumford boundary.We compute the number of con…

Study of flows with a single singular point on a 2D disk.

This paper establishes the geometric structure of the lines of principal curvature of a hypersurface immersed in ${\mathbb R}^4$ in a neighborhood of the set $\mathcal{S}$ of its principal curvature singularities, consisting of the points at which atF least two principal curvatures are equal. Under generic conditions d…

A meander is a topological configuration of a line and a simple closed curve in the plane (or a pair of simple closed curves on the 2-sphere) intersecting transversally. Meanders can be traced back to H. Poincaré and naturally appear in various areas of mathematics, theoretical physics and computational biology (in par…

This work deals with the topological classification of germs of singular foliations on $(\mathbb C^{2},0)$. Working in a suitable class of foliations we fix the topological invariants given by the separatrix set, the Camacho-Sad indices and the projective holonomy representations and we compute the moduli space of topo…

This research classifies singular foliations and finds a universal deformation.

The paper refines transformations of lattice diagrams and introduces dotted diagrams.

This note explains how to transform Heegaard diagrams into framed link diagrams.

New minimal link diagrams found, including torus links and homogeneous ones.

Algorithm converts Kirby diagrams to trisection diagrams for 4-manifolds.

Kernelized Taylor diagram visualizes data populations with fewer assumptions.

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …

Study categorizes knots and links as rigid or shaky based on Reidemeister moves.

Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…

Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams in machine learning have been done through kernel methods, i.e., embeddings of …

Problems on region choices for knot and link diagrams solved using Alexander numbering.

Table of symmetric diagrams for knots up to 10 crossings.

The presence of slipknots in configurations of proteins and DNA has been shown to affect their functionality, or alter it entirely. Historically, polymers are modeled as polygonal chains in space. As an alternative to space curves, we provide a framework for working with subknots inside of knot diagrams via knotoid dia…

Proves minimal crossing diagrams for specific spatial graphs.

Rectangular diagrams help analyze foliations in 3-sphere.

Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram representing the trivial knot. As a corollary we determine an unknotting number one alter…

The paper explores when specific knot operations simplify diagrams.

Gauss diagrams' properties can change with Hamiltonian cycle choice.

New estimate of semimeander complexity for knots with more than 10 crossings.

Paper proves link diagrams can be realized for some but not all types of links.

GridPyM handles grid diagrams for knot theory.

There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While every plane graph arises as a Tait graph of a unique link diagram, not every embedd…

The study improves inequalities for link diagrams and introduces weak rectangular diagrams.

In this paper, a link diagram is said to be minimal if no Reidemeister move I or II can be applied to it to reduce the number of crossings. We show that for an arbitrary diagram D of a link without a trivial split component, a minimal diagram obtained by applying Reidemeister moves I and II to D is unique. The proof al…

Algorithm for recognizing and performing Reidemeister moves in Gauss diagrams.

Standard trisection diagrams found for Mazur type 4-manifolds.

By using the cohomology theory of quandles, quandle cocycle invariants and shadow quandle cocycle invariants are defined for oriented links and surface-links via broken surface diagrams. By using symmetric quandles, symmetric quandle cocycle invariants are also defined for unoriented links and surface-links via broken …

Minimal grid diagrams for 12-crossing prime knots identified.

The paper introduces triple grid diagrams to construct Lagrangian surfaces in complex projective space.

Complete criterion for VoI in multi-decision influence diagrams established.

A virtual link diagram is called mod $m$ almost classical if it admits an Alexander numbering valued in integers modulo $m$, and a virtual link is called mod $m$ almost classical if it has a mod $m$ almost classical diagram as a representative. In this paper, we introduce a method of constructing a mod $m$ almost class…

Algorithm constructs Kirby diagrams for 4D open books.

Study minimum ribbonlength of immersed flat knots and links.

For an oriented virtual link, L.H. Kauffman defined the f-polynomial (Jones polynomial). The supporting genus of a virtual link diagram is the minimal genus of a surface in which the diagram can be embedded. In this paper we show that the span of the f-polynomial of an alternating virtual link L is determined by the nu…

Study shows that splitting links requires an arbitrarily large number of extra crossings.