Seifert cohomology of trees
classification
🧮 math.CO
math.GT
keywords
cohomologycomplextreealexanderassociatecasecharacteristicclear
read the original abstract
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 characteristic of this complex coincides with the Alexander polynomial of the link. In this case we also point the relation to the Heegard-Floer homology theory, constructed by P. Ozsvath and Z. Szabo.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.