scholarly journals A Super-Analogue of Kontsevich’s Theorem on Graph Homology

2006 ◽  
Vol 76 (1) ◽  
pp. 37-55 ◽  
Author(s):  
Alastair Hamilton
Keyword(s):  
2006 ◽  
Vol 190 ◽  
pp. 139-177 ◽  
Author(s):  
Laure Helme-Guizon ◽  
Józef H. Przytycki ◽  
Yongwu Rong
Keyword(s):  

2008 ◽  
Vol 17 (12) ◽  
pp. 1549-1559 ◽  
Author(s):  
E. WAGNER

In analogy with a recursive formula for the HOMFLY-PT polynomial of links given by Jaeger, we give a recursive formula for the graph polynomial introduced by Kauffman and Vogel. We show how this formula extends to the Khovanov–Rozansky graph homology.


2013 ◽  
Vol 336 ◽  
pp. 180-222 ◽  
Author(s):  
Dirk Kreimer ◽  
Matthias Sars ◽  
Walter D. van Suijlekom

2012 ◽  
Vol 11 (02) ◽  
pp. 1250031
Author(s):  
PAUL TURNER ◽  
EMMANUEL WAGNER

Przytycki has established a connection between the Hochschild homology of an algebra A and the chromatic graph homology of a polygon graph with coefficients in A. In general the chromatic graph homology is not defined in the case where the coefficient ring is a non-commutative algebra. In this paper we define a new homology theory for directed graphs which takes coefficients in an arbitrary A–A bimodule, for A possibly non-commutative, which on polygons agrees with Hochschild homology through a range of dimensions.


2016 ◽  
Vol 76 (3) ◽  
pp. 1126-1151 ◽  
Author(s):  
Jared C. Bronski ◽  
Lee DeVille ◽  
Timothy Ferguson

2007 ◽  
Vol 310 (2) ◽  
pp. 730-741
Author(s):  
Fusun Akman ◽  
Lucian M. Ionescu ◽  
Papa Sissokho

2014 ◽  
Vol 176 (1) ◽  
pp. 345-374 ◽  
Author(s):  
James Conant ◽  
Martin Kassabov ◽  
Karen Vogtmann
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document