arXiv research

This paper establishes an equivalence between transitive double Lie algebroids and core diagrams.

Core groups are link invariants defined by arc or region presentations.

We introduce a way to color the regions of a classical knot diagram using ternary operations, so that the number of colorings is a knot invariant. By choosing appropriate substitutions in the algebras that we assign to diagrams, one obtains the relations from the knot group, and from the core group. Using the ternary o…

A virtual $n$-string is a chord diagram with $n$ core circles and a collection of arrows between core circles. We consider virtual $n$-strings up to virtual homotopy, compositions of flat virtual Reidemeister moves on chord diagrams. Given a virtual 1-string $α$, Turaev associated a based matrix that encodes invariants…

Basket links are shown to be isotopic to $T(2,n+1)$.

New perspective on Heegaard splittings using square complexes and combinatorial measurements.

CoSE models complex drawings by treating strokes as a collection that can be composed.

Node-link diagrams are a popular method for representing graphs that capture relationships between individuals, businesses, proteins, and telecommunication endpoints. However, node-link diagrams may fail to convey insights regarding graph structures, even for moderately sized data of a few hundred nodes, due to visual …

Geometrically classifies total stability spaces for Dynkin diagrams.

We introduce new polynomial isotopy invariants for closed braids. They are constructed as polynomial valued {\em Gauss diagram 1-cocycles} evaluated on the full rotation of the closed braid $\hat β$ around the core of the corresponding solid torus. They can be calculated with polynomial complexity with respect to the b…

Knitted and woven textile structures are examples of doubly periodic structures in a thickened plane made out of intertwining strands of yarn. Factoring out the group of translation symmetries of such a structure gives rise to a link diagram in a thickened torus. Such a diagram on a standard torus is converted into a c…

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.

New peripheral structure for core groups detects noninvertible knots.

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

In various application areas, networked data is collected by measuring interactions involving some specific set of core nodes. This results in a network dataset containing the core nodes along with a potentially much larger set of fringe nodes that all have at least one interaction with a core node. In many settings, t…

Kernelized Taylor diagram visualizes data populations with fewer assumptions.

AL$\ell_0$CORE tensor decomposition reduces computational cost for sparse count data.

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.

Interbank markets are often characterised in terms of a core-periphery network structure, with a highly interconnected core of banks holding the market together, and a periphery of banks connected mostly to the core but not internally. This paradigm has recently been challenged for short time scales, where interbank ma…

We introduce the notion of the visual core of a hyperbolic 3-manifold N and explore its basic properties. The visual core can be thought of as a harmonic analysis analogue of the convex core. We investigate circumstances in which the visual core of a cover N' of N embeds under the covering map from N' to N. We apply th…

New combinatorial structures represent subgroups of surface groups, analogous to Stallings core graphs.

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 introduces a core-periphery model for identifying informative network structures.

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.