𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Number of Sets Definable by Polynomials

✍ Scribed by Gabriela Jeronimo; Juan Sabia


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
102 KB
Volume
227
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

✦ Synopsis


We show that the known algorithms used to re-write any first order quantifierfree formula over an algebraically closed field into its normal disjunctive form are essentially optimal. This result follows from an estimate of the number of sets definable by equalities and inequalities of fixed polynomials. Finally we apply our results to obtain similar estimates in the real case.


📜 SIMILAR VOLUMES


A note on the predicatively definable se
✍ Stephen L. Bloom 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

A NOTE ON THE PREDICATIVELY DEFINABLE SETS OF N. N. NEPE~VODA by STEPHEN L. BLOOM in Yorktown Heights, New York (U.S.A.)') ') 1BM Watson Research Center. On leave from Stevens Institute of Technology. -The author ie plewd to acknowledge several extremely helpful conversations with JESSE B. WRIGHT du

On the Boolean algebras of definable set
✍ Stefano Leonesi; Carlo Toffalori 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 1 views

## Abstract We consider the sets definable in the countable models of a weakly o‐minimal theory __T__ of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic (hence __T__ is p‐__ω__‐categorical), in other words when each of these definable sets adm

On the Number of Solutions of Polynomial
✍ M. Boguslavsky 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 247 KB

We consider systems of homogenous polynomial equations of degree d in a projective space ‫ސ‬ m over a finite field ‫ކ‬ q . We attempt to determine the maximum possible number of solutions of such systems. The complete answer for the case r ϭ 2, d Ͻ q Ϫ 1 is given, as well as new conjectures about th