Let be any number field or p-adic field and consider F:=(f 1,... ,/f k) where f 1,...,f k [x 1,... ,x n] and no more than distinct exponent vectors occur in the monomial term expansions of the f i. We prove that F has no more than 1 + (Cn( - n) 3 log ( - n) n geometrically isolated roots in n, where C is an explicit and effectively computable constant depending only on . This gives a significantly sharper arithmetic analogue of Khovanski's Theorem on Real Fewnomials and a higher-dimensional generalization of an earlier result of Hendrik W. Lenstra, Jr. for the special case of a single univariate polynomial. We also present some further refinements of our new bounds and a higher-dimensional generalization of a bound of Lipshitz on p-adic complex roots. Connections to non-Archimedean amoebae and computational complexity (including additive complexity and solving for the geometrically isolated rational roots) are discussed along the way. We thus provide the foundations for an effective arithmetic analogue of fewnomial theory.
