Combinatorial computation of the motivic Poincare series

preprint2011arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.