arXiv (All)
open access
Counting rational points on affine hypersurfaces
We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of points $(x_1, \dots, x_n) \in \mathbb{Q}^n$ such that $f(x_1,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Non-reducedness of the Hilbert schemes of few points#793355
- Non-reducedness of the Hilbert schemes of few points#789351
- An Approximate Counting Version of the Multidimensional Szemerédi Theorem#628833
- UTVPI-representable integer point sets: discrete convexity, polymorphisms, and pairwise closure#1035599
- Sumsets of Ahlfors--David regular sets#1013896
Record · ID 974275
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive