scholarly journals Legendrian links and the spanning tree model for Khovanov homology

2006 ◽  
Vol 6 (4) ◽  
pp. 1745-1757 ◽  
Author(s):  
Hao Wu
Keyword(s):  
Spanning Tree ◽  
Khovanov Homology ◽  
Tree Model ◽  
Legendrian Links

scholarly journals A SPANNING TREE MODEL FOR KHOVANOV HOMOLOGY

2008 ◽  
Vol 17 (12) ◽  
pp. 1561-1574 ◽  
Author(s):  
S. WEHRLI
Keyword(s):  
Spanning Tree ◽  
Spanning Trees ◽  
Khovanov Homology ◽  
Link Diagram ◽  
Tree Model

We show that the Khovanov complex of a connected link diagram D retracts to a subcomplex whose generators are in 2:1 correspondence with the spanning trees of the "black graph" of D. Using this result, we give a new proof of Lee's theorem on the support of Khovanov homology of alternating knots.

scholarly journals A combinatorial spanning tree model for knot Floer homology

2012 ◽  
Vol 231 (3-4) ◽  
pp. 1886-1939 ◽  
Author(s):  
John A. Baldwin ◽  
Adam Simon Levine
Keyword(s):  
Spanning Tree ◽  
Floer Homology ◽  
Tree Model ◽  
Knot Floer Homology

Minimizing travel claims cost with minimal-spanning tree model

2014 ◽  
Author(s):  
Mohd Helmi Jamalluddin ◽  
Mohd Azrul Jaafar ◽  
Mohd Iskandar Amran ◽  
Mohd Sharizal Ainul ◽  
Aqmar Hamid ◽  
...  
Keyword(s):  
Spanning Tree ◽  
Minimal Spanning Tree ◽  
Tree Model

scholarly journals KHOVANOV HOMOLOGY FOR VIRTUAL KNOTS WITH ARBITRARY COEFFICIENTS

2007 ◽  
Vol 16 (03) ◽  
pp. 345-377 ◽  
Author(s):  
VASSILY OLEGOVICH MANTUROV
Keyword(s):  
Spanning Tree ◽  
Classical Case ◽  
Homology Theory ◽  
Homotopy Equivalent ◽  
Khovanov Homology ◽  
Virtual Knots ◽  
Definition Of

In the present paper, we construct Khovanov homology theory with arbitrary coefficients for arbitrary virtual knots. We give a definition of the complex, which is homotopy equivalent to the initial Khovanov complex in the classical case; our definition works in the virtual case as well. The method used in this work allows us to construct a Khovanov homology theory for "twisted virtual knots" in the sense of Bourgoin and Viro [4, 27] (in particular, for knots in RP3). We also generalize some results of the Khovanov homology for virtual knots with arbitrary atoms (Wehrli and Kofman–Champanerkar spanning tree, minimality problems, Frobenius extensions) and orientable ones (Rasmussen's invariant).

scholarly journals Analysis of the total costs for variants of the Union-Find algorithm

2007 ◽  
Vol DMTCS Proceedings vol. AH,... (Proceedings) ◽  
Author(s):  
Markus Kuba ◽  
Alois Panholzer
Keyword(s):  
Method Of Moments ◽  
Spanning Tree ◽  
Limiting Distribution ◽  
Tree Model ◽  
Average Behavior ◽  
Finite Set ◽  
International Audience

International audience We study the average behavior of variants of the UNION-FIND algorithm to maintain partitions of a finite set under the random spanning tree model. By applying the method of moments we can characterize the limiting distribution of the total costs of the algorithms "Quick Find Weighted'' and "Quick Find Biased'' extending the analysis of Knuth and Schönhage, Yao, and Chassaing and Marchand.

Sign in / Sign up

Export Citation Format

Share Document