pith. sign in

arxiv: math/0010260 · v3 · submitted 2000-10-27 · 🧮 math.NT · math.AG

Finiteness for Arithmetic Fewnomial Systems

classification 🧮 math.NT math.AG
keywords arithmeticfinitenumbernumbersrationalalgebraicanalogueappearing
0
0 comments X
read the original abstract

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms appearing in at least one g_i is exactly m. We prove that the maximum number of isolated roots of G:=(g_1,...,g_k) in L^n is finite and depends solely on (m,n,L), i.e., is independent of the degrees of the g_i. We thus obtain an arithmetic analogue of Khovanski's Theorem on Fewnomials, extending earlier work of Denef, Van den Dries, Lipshitz, and Lenstra.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.