arXiv · 1006.3533
On one example and one counterexample in counting rational points on graph hypersurfaces
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Dzmitry Doryn. 2010-06-17. On one example and one counterexample in counting rational points on graph hypersurfaces. https://doi.org/10.1007/s11005-011-0501-1
Cite the original work for its findings. Save a collection to share your selection of sources.