Homotopy type of circle graph complexes motivated by extreme Khovanov homology
Józef Henryk Przytycki , Marithania Silvero
AbstractIt was proven by González-Meneses, Manchón and Silvero that the extreme Khovanov homology of a link diagram is isomorphic to the reduced (co)homology of the independence simplicial complex obtained from a bipartite circle graph constructedfrom the diagram. In this paper, we conjecture that this simplicial complex is always homotopy equivalent to a wedge of spheres. In particular, its homotopy type, if not contractible, would be a link invariant (up to suspension), and it would imply that the extreme Khovanov homology of any link diagram does not contain torsion. We prove the conjecture in many special cases and find it convincing to generalizeit to every circle graph (intersection graph of chords in a circle). In particular, we prove it for the families of cactus, outerplanar, permutation and non-nested graphs.Conversely, we also give a method for constructing a permutation graph whose independence simplicial complex is homotopy equivalent to any given finite wedge ofspheres. We also present some combinatorial results on the homotopy type of finite simplicial complexes and a theorem shedding light on previous results by Csorba, Nagel and Reiner, Jonsson and Barmak. We study the implications of our results toknot theory; more precisely, we compute the real-extreme Khovanov homology of torus links T (3, q) and obtain examples of H-thick knots whose extreme Khovanov homology groups are separated either by one or two gaps as long as desired.
|Journal series||Journal of Algebraic Combinatorics, ISSN 0925-9899, (A 30 pkt)|
|Publication size in sheets||1.85|
|Keywords in English||circle graphs, independence simplicial complex, Khovanov homology, torus links, wedge of spheres|
|Score|| = 30.0, 13-11-2018, ArticleFromJournal|
= 30.0, 13-11-2018, ArticleFromJournal
|Publication indicators||: 2016 = 0.779 (2) - 2016=0.742 (5)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.