Related papers: Unsigned state models for the Jones polynomial
Whitney's theorem states that every 3-connected planar graph is uniquely embeddable on the sphere. On the other hand, it has many inequivalent embeddings on another surface. We shall characterize structures of a $3$-connected $3$-regular…
A circuit double cover of a bridgeless graph is a collection of even subgraphs such that every edge is contained in exactly two subgraphs of the given collection. Such a circuit double cover describes an embedding of the corresponding graph…
Let $G=(V,E)$ be a simple undirected graph with $n$ vertices then a set partition $\pi=\{V_1, ..., V_k\}$ of the vertex set of $G$ is a connected set partition if each subgraph $G[V_j]$ induced by the blocks $V_j$ of $\pi$ is connected for…
The Laplacian matrix $L$ of a signed graph $G$ may or may not be invertible. We present a combinatorial formula of the Moore-Penrose inverse of $L$. This is achieved by finding a combinatorial formula for the Moore-Penrose inverse of an…
An open question akin to the slice-ribbon conjecture asks whether every ribbon knot can be represented as a symmetric union. Next to this basic existence question sits the question of uniqueness of such representations. Eisermann and Lamm…
In this paper, we consider generalizations of the Alexander polynomial and signature of 2-bridge knots by considering the Gordon-Litherland bilinear forms associated to essential state surfaces of the 2-bridge knots. We show that the…
In this paper, we consider polynomials and ideals obtained from the colored Jones polynomial in both commutative and noncommutative cases. In the commutative case, this ideal contains polynomials that can be regarded as the link version of…
The Slope Conjecture relates the degree of the colored Jones polynomial of a knot to boundary slopes of incompressible surfaces. Our aim is to prove the Slope Conjecture for Montesinos knots, and to match parameters of a state-formula for…
A path integral on a link complement of a three-sphere fixes a vector (the "link state") in Chern-Simons theory. The link state can be written in a certain basis with the colored link invariants as its coefficients. We use symmetric webs to…
The independence polynomial $i(G,x)$ of a graph $G$ is the generating function of the numbers of independent sets of each size. A graph of order $n$ is very well-covered if every maximal independent set has size $n/2$. Levit and Mandrescu…
This paper is a brief overview of recent results by the authors relating colored Jones polynomials to geometric topology. The proofs of these results appear in the papers [arXiv:1002.0256] and [arXiv:1108.3370], while this survey focuses on…
The Jones polynomial and Khovanov homology of a classical link are invariants that depend upon an initial choice of orientation for the link. In this paper, we give a Khovanov homology theory for unoriented virtual links. The graded Euler…
As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell…
Invariant polynomials for torus links are obtained in the framework of the Chern-Simons topological gauge theory. The polynomials are computed as vacuum expectation values on the three-sphere of Wilson line operators representing the…
Dye and Kauffman defined surface bracket polynomials for virtual links by use of surface states, and found a relationship between the surface states and the minimal genus of a surface in which a virtual link diagram is realized. They and…
Feature extraction and dimension reduction for networks is critical in a wide variety of domains. Efficiently and accurately learning features for multiple graphs has important applications in statistical inference on graphs. We propose a…
This paper is a memory of the work and influence of Vaughan Jones. It is an exposition of the remarkable breakthroughs in knot theory and low dimensional topology that were catalyzed by his work. The paper recalls the inception of the Jones…
It has been recently shown that any graph of genus g>0 can be stochastically embedded into a distribution over planar graphs, with distortion Olog (g+1)) [Sidiropoulos, FOCS 2010]. This embedding can be computed in polynomial time, provided…
We extend a result of Thistlethwaite [17, Theorem 1(iv)] on the structure of the Jones polynomial of alternating links to the wider class of quasi-alternating links. In particular, we prove that the Jones polynomial of any prime…
We prove an explicit cabling formula for the colored Jones polynomial. As an application we prove the volume conjecture for all zero volume knots and links, i.e. all knots and links that are obtained from the unknot by repeated cabling and…