Abstract

In this paper we present a concrete counterexample to the conjecture of Kontsevich about the polynomial countability of graph hypersurfaces. In contrast to this, we show that the "wheel with spokes" graphs $WS_n$ are polynomially countable.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call