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 WSn are polynomially countable.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.