Finiteness for Arithmetic Fewnomial Systems

dc.creatorRojas, J. Maurice
dc.date2000-10-27
dc.date2001-03-30
dc.date.accessioned2026-07-07T04:38:16Z
dc.date.available2026-07-07T04:38:16Z
dc.descriptionSuppose 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.
dc.description6 pages; 1 figure (file=5adic.ps); needs my mildly hacked versions of amsart.cls and jams-l.cls, which are included. This is the final version and removes all ramification hypotheses, quotes some more explicit bounds for the benefit of the reader, streamlines some proofs, and corrects some more typos
dc.identifierhttps://arxiv.org/abs/math/0010260
dc.identifierhttp://arxiv.org/abs/math/0010260
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60212
dc.subjectNumber Theory
dc.subjectAlgebraic Geometry
dc.subjectPrimary: 11G25; Secondary: 11G35, 14D10, 14G20
dc.titleFiniteness for Arithmetic Fewnomial Systems
dc.typetext

Files

Collections