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 $W{S}_n$ are polynomially countable.

References in corpus (1)

• Motives associated to sums of graphs

Cited by in corpus (17)

• A K3 in phi4
• Feynman integrals and hyperlogarithms
• The Galois coaction on ${\varphi }^4$ periods
• Feynman Amplitudes and Cosmic Galois group
• Feynman integrals and motives of configuration spaces
• Periods and Feynman amplitudes
• Algebraic Structures in local QFT
• Chern classes of graph hypersurfaces and deletion-contraction
• Matroid connectivity and singularities of configuration hypersurfaces
• Feynman integrals and periods in configuration spaces
• Rota-Baxter algebras, singular hypersurfaces, and renormalization on Kausz compactifications
• Motives of graph hypersurfaces with torus operations
• Potts models with magnetic field: arithmetic, geometry, and computation
• Position Space Feynman quadrics and their motives
• Feynman quadrics-motive of the massive sunset graph
• On $c_2$ invariants of 4-regular Feynman graphs
• Arithmetic of Potts model hypersurfaces