arXiv research

Study connects Morse theory with cluster variables for wall-crossing in Cerf diagrams.

Constructs pseudo-isotopies with Cerf diagrams and Hatcher-Wagoner invariants for barbell maps.

Heegaard splittings and Heegaard diagrams of a closed 3-manifold M are translated into the language of Morse functions with Morse-Smale pseudo-gradients defined on M. We make use in a very simple setting of techniques which Jean Cerf developed for solving a famous pseudo-isotopy problem. In passing, we show how to canc…

Simplified proof of Cerf's theorem on 3-sphere diffeomorphisms.

New proof of Laudenbach and Poénaru's theorem on 4D 1-handlebodies.

We develop a technique for gluing relative trisection diagrams of $4$-manifolds with nonempty connected boundary to obtain trisection diagrams for closed $4$-manifolds. As an application, we describe a trisection of any closed $4$-manifold which admits a Lefschetz fibration over $S^2$ equipped with a section of square …

New invariants for 3-manifolds derived from equivariant Cerf theory.

Following a line of reasoning suggested by Eliashberg, we prove Cerf's theorem that any diffeomorphism of the 3-sphere extends over the 4-ball. To this end we develop a moduli-theoretic version of Eliashberg's filling-with-holomorphic-discs method.

New method for analyzing multiparameter persistence modules from smooth functions.

In [Topology 35 (1996) 1005--1023] J H Rubinstein and M Scharlemann, using Cerf Theory, developed tools for comparing Heegaard splittings of irreducible, non-Haken manifolds. As a corollary of their work they obtained a new proof of Waldhausen's uniqueness of Heegaard splittings of S^3. In this note we use Cerf Theory …

New findings about twists in 4-sphere diffeomorphisms.

We give an entirely geometric proof, without recourse to cellular homology, of the fact that $\partial^2=0$ in the chain complex defined by a handle decomposition of a given manifold. Topological invariance of the resulting `handle homology' is a consequence of Cerf theory.

The paper develops finite knot theory using ropelength-filtered Reidemeister graphs.

The paper explores how topological methods can reveal insights into electric charge distributions on knots.

The kernel embedding algorithm is an important component for adapting kernel methods to large datasets. Since the algorithm consumes a major computation cost in the testing phase, we propose a novel teacher-learner framework of learning computation-efficient kernel embeddings from specific data. In the framework, the h…

Link concordance equals homotopy for high-dimensional spheres.

We consider an oriented surface S and a cellular complex X of curves on S, defined by Hatcher and Thurston in 1980. We prove by elementary means, without Cerf theory, that the complex X is connected and simply connected. From this we derive an explicit simple presentation of the mapping class group of S, following the …

The paper connects diffeomorphism groups and sphere embeddings, proving a group structure.

This paper extends results of Hatcher and Vogtmann's work "Cerf Theory for Graphs" to ribbon graphs. Given an orientable, punctured and basepointed surface Sigma, we prove that the space of ribbon graphs that can be drawn in Sigma is filtered by simplicial complexes. The k-th simplicial complex is (k-1)-dimensional, (k…

Extends Palais' result on diffeomorphisms to homeomorphisms and bi-Lipschitz mappings.

We discuss generic smooth maps from smooth manifolds to smooth surfaces, which we call "Morse 2-functions", and homotopies between such maps. The two central issues are to keep the fibers connected, in which case the Morse 2-function is "fiber-connected", and to avoid local extrema over 1-dimensional submanifolds of th…

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.

For a riemannian foliation $\mathcal{F}$ on a closed manifold $M$, it is known that $\mathcal{F}$ is taut (i.e. the leaves are minimal submanifolds) if and only if the (tautness) class defined by the mean curvature form $κ_μ$ (relatively to a suitable riemannian metric $μ$) is zero. In the transversally orientable case…

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.