Finiteness for Arithmetic Fewnomial Systems
Abstract
Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g1,...,gk be polynomials in n variables, with coefficients in L, such that the total number of monomial terms appearing in at least one gi is exactly m. We prove that the maximum number of isolated roots of G:=(g1,...,gk) in Ln is finite and depends solely on (m,n,L), i.e., is independent of the degrees of the gi. We thus obtain an arithmetic analogue of Khovanski's Theorem on Fewnomials, extending earlier work of Denef, Van den Dries, Lipshitz, and Lenstra.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.