Related papers: Link homology and categorification
This is a survey of some recent developments concerning the p-adic cohomology of algebraic varieties over fields of positive characteristic and local fields of mixed characteristic, plus some related areas like p-adic Hodge theory.
We study the head and tail of the colored Jones polynomial while focusing mainly on alternating links. Various ways to compute the colored Jones polynomial for a given link give rise to combinatorial identities for those power series. We…
We provide various formulations of knot homology that are predicted by string dualities. In addition, we also explain the rich algebraic structure of knot homology which can be understood in terms of geometric representation theory in these…
In this paper, we derive some interesting symmetric properties for the geenralized Euler numbers and polynomials.
As an extension of positive and almost positive diagrams and links, we study two classes of links we call successively almost positive and weakly successively almost positive links. We prove various properties of polynomial invariants and…
Based on different views on the Jones polynomial we review representation theoretic categorified link and tangle invariants. We unify them in a common combinatorial framework and connect them via the theory of Soergel bimodules. The…
Persistent homology enables fast and computable comparison of topological objects. However, it is naturally limited to the analysis of topological spaces. We extend the theory of persistence, by guaranteeing robustness and computability to…
Topological properties of networks are widely applied to study the link-prediction problem recently. Common Neighbors, for example, is a natural yet efficient framework. Many variants of Common Neighbors have been thus proposed to further…
In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.
Everyone knows that the Euler characteristic of a combinatorial manifold is given by the alternating sum of its numbers of simplices. It is shown that there are other linear combinations of the numbers of simplices which are combinatorial…
The purpose of this paper is to present a certain combinatorial method of constructing invariants of isotopy classes of oriented tame links. This arises as a generalization of the known polynomial invariants of Conway and Jones. These…
Measuring the entanglement complexity of collections of open curves in 3-space has been an intractable, yet pressing mathematical problem, relevant to a plethora of physical systems, such as in polymers and biopolymers. In this manuscript,…
To every tree we associate a filtered cochain complex. Its cohomology and the corresponding spectral sequence have clear combinatorial description. If a tree is the Dynkin diagram of a simple plane curve singularity, the graded Euler…
In the first of these two lectures, I use a comparison to symplectic Khovanov homology to motivate the idea that the Jones polynomial and Khovanov homology of knots can be defined by counting the solutions of certain elliptic partial…
Khovanov homology of a link and chromatic graph homology are known to be isomorphic in a range of homological gradings that depend on the girth of a graph. We discuss patterns shared by these two homology theories. In particular, we improve…
We extend knot Floer homology to string links in D^{2} \times I and to d-based links in arbitrary three manifolds, without any hypothesis on the null-homology of the components. As for knot Floer homology we obtain a description of the…
This paper formulates a generalization of our work on quantum knots to explain how to make quantum versions of algebraic, combinatorial and topological structures. We include a description of previous work on the construction of Hilbert…
In this paper, a relationship between the determinant of an alternating link and a certain polytope obtained from the link diagram is analyzed. We also show that when the underlying graph of the link diagram is properly oriented, the number…
A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the link. We generalize this result to show that the…
For each graph, we construct a bigraded chain complex whose graded Euler characteristic is a version of the Tutte polynomial. This work is motivated by earlier work of Khovanov, Helme-Guizon and Rong, and others.