Related papers: The Prevalence of Persistent Tangles
We redevelop persistent homology (topological persistence) from a categorical point of view. The main objects of study are diagrams, indexed by the poset of real numbers, in some target category. The set of such diagrams has an interleaving…
In this paper I study a variant of the general vertex coloring problem called precoloring. Specifically, I study graph precolorings, by developing new theory, for characterizing the minimal non-extensible precolorings. It is interesting per…
The central discovery of $2d$ conformal theory was holomorphic factorization, which expressed correlation functions through bilinear combinations of conformal blocks, which are easily cut and joined without a need to sum over the entire…
Knot theory is actively studied both by physicists and mathematicians as it provides a connecting centerpiece for many physical and mathematical theories. One of the challenging problems in knot theory is distinguishing mutant knots. Mutant…
Knot contact homology is an ambient isotopy invariant of knots and links in $\mathbb R^3$. The purpose of this paper is to extend this definition to an ambient isotopy invariant of tangles and prove that gluing of tangles gives a gluing…
We generalise the finite biquandle colouring invariant to a polynomial invariant based on labelling a knot diagram with a finite birack that reduces to the biquandle colouring invariant in that case. The polynomial is an invariant of a…
In this paper, we consider the Visibility Graph Recognition and Reconstruction problems in the context of terrains. Here, we are given a graph $G$ with labeled vertices $v_0, v_1, \ldots, v_{n-1}$ such that the labeling corresponds with a…
An initially knotted light field will stay knotted if it satisfies a set of nonlinear, geometric constraints, i.e. the null conditions, for all space-time. However, the question of when an initially null light field stays null has remained…
The homology and cohomology of quandles and racks are used in knot theory: given a finite quandle and a cocycle, we can construct a knot invariant. This is a quick introductory survey to the invariants of knots derived from quandles and…
We consider random graphs sampled uniformly from a structured class of graphs, such as the class of graphs embeddable in a given surface. We sharpen and extend earlier results on pendant appearances, concerning for example numbers of…
The persistent homology of a stationary point process on ${\bf R}^N$ is studied in this paper. As a generalization of continuum percolation theory, we study higher dimensional topological features of the point process such as loops,…
The persistence theory has been employed by several authors in order to study persistence properties of dynamical systems generated by ordinary differential equations or maps across diverse disciplines. In this note, the author discusses a…
We construct an infinite collection of knots with the property that any knot in this family has $n$-string essential tangle decompositions for arbitrarily high $n$.
In this paper, a regional knot invariant is constructed. Like the Wirtinger presentation of a knot group, each planar region contributes a generator, and each crossing contributes a relation. The invariant is call a tridle of the link. As…
Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification. Being able to capture long range graph properties via higher-order topological features,…
We consider incidences among colored sets of lines in $\mathbb{R}^d$ and examine whether the existence of certain concurrences between lines of $k$ colors force the existence of at least one concurrence between lines of $k+1$ colors. This…
Triangulation graph staining is sufficient for planar graph staining. This article will focus on triangulation and the nature of the color change channel of the staining tool. By construction, the four colors of the vertex are converted…
We introduce a new notion of resilience for constraint satisfaction problems, with the goal of more precisely determining the boundary between NP-hardness and the existence of efficient algorithms for resilient instances. In particular, we…
We explore free knot diagrams, which are projections of knots into the plane which don't record over/under data at crossings. We consider the combinatorial question of which free knot diagrams give which knots and with what probability.…
Computational topology has recently known an important development toward data analysis, giving birth to the field of topological data analysis. Topological persistence, or persistent homology, appears as a fundamental tool in this field.…