Related papers: The Prevalence of Persistent Tangles
An enhanced trivalent tangle is a trivalent tangle with some of its edges labeled. We use enhanced trivalent tangles and classical knot theory to provide a recipe for constructing invariants for trivalent tangles, and in particular, for…
Twisted links are a generalization of classical links and correspond to stably equivalence classes of links in thickened surfaces. In this paper we introduce twisted intersection colorings of a diagram and construct two invariants of a…
This is an introductory article on high dimensional knots for the beginners. High dimensional knot theory is an exciting field. It is a field of knot theory, which is one of topology and is connected with many ones. In this article we use…
One of the most elusive challenges within the area of topological data analysis is understanding the distribution of persistence diagrams. Despite much effort, this is still largely an open problem. In this paper, we present a series of…
A characterization of the structure of a regular matrix pencil obtained by a bounded rank perturbation of another regular matrix pencil has been recently obtained. The result generalizes the solution for the bounded rank perturbation…
Regular variation of distributional tails is known to be preserved by various linear transformations of some random structures. An inverse problem for regular variation aims at understanding whether the regular variation of a transformed…
Previously, the graph permanent was introduced as a single-valued invariant for graphs $G$ with $|E(G)| = k(|V(G)|-1)$ for some $k \in \mathbb{Z}_{>0}$. Herein, we construct the extended graph permanent, an infinite sequence for all graphs.…
We study semi-dynamical systems associated to delay differential equations. We give a simple criteria to obtain weak and strong persistence and provide sufficient conditions to guarantee uniform persistence. Moreover, we show the existence…
We investigate when the tangent bundle of a projective manifold has a non-trivial first order (or positive-dimensional) deformation. This leads to a new conjectural characterization of the complex projective space.
We consider a quiver structure on the set of quandle colorings of an oriented knot or link diagram. This structure contains a wealth of knot and link invariants and provides a categorification of the quandle counting invariant in the most…
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…
We introduce the notion of a hierarchical quandle, which is a generalisation of diquandles and multi-quandles. Using hierarchical quandle colourings, we construct a cocycle invariants for links coloured by quandles.
These notes are a self-contained short proof of the stability of persistence diagrams.
Motivated by the work in [15], this paper deals with the theory of the braids from chromatic configuration spaces. This kind of braids possess the property that some strings of each braid may intersect together and can also be untangled, so…
A tangle of order $k$ in a matroid or graph may be thought of as a "$k$-connected component". For a tangle of order $k$ in a matroid or graph that satisfies a certain robustness condition, we describe a tree decomposition of the matroid or…
Crossings of knot diagrams can be divided into classes (tribes) compatible with Reidemeister moves. Tribes can be considered as localization of the notion of weak chord index introduced by M. Xu. In the article we describe tribes of…
We show that, for any graph or matroid, there is a tree that simultaneously distinguishes its maximal tangles, and, for each maximal tangle $\mathcal{T}$ that satisfies an additional robustness condition, displays all of the non-trivial…
A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a thrackle drawing of a graph on the plane cannot have more edges than vertices. We prove the Conjecture for…
We give a unified proof of the existence of turbulence for some classes of continuous interval maps which include, among other things, maps with periodic points of odd periods > 1, some maps with dense chain recurrent points and densely…
Three-dimensional three-colour percolation on a lattice made of tetrahedra is a direct generalization of two-dimensional two-colour percolation on the triangular lattice. The interfaces between one-colour clusters are made of bicolour…