Combinatorial computation of the motivic Poincare series
Algebraic Geometry
2011-04-20 v2 Geometric Topology
Abstract
We give the explicit algorithm computing the motivic generalization of the Poincare series of the plane curve singularity introduced by A. Campillo, F. Delgado and S. Gusein-Zade. It is done in terms of the embedded resolution of the curve. The result is a rational function depending of the parameter q, at q=1 it coincides with the Alexander polynomial of the corresponding link. For irreducible curves we relate this invariant to the Heegard-Floer knot homologies constructed by P. Ozsvath and Z. Szabo. Many explicit examples are considered.
Keywords
Cite
@article{arxiv.0807.0491,
title = {Combinatorial computation of the motivic Poincare series},
author = {E. Gorsky},
journal= {arXiv preprint arXiv:0807.0491},
year = {2011}
}
Comments
43 pages