𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Number of Solutions of Polynomial Systems

✍ Scribed by M. Boguslavsky


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
247 KB
Volume
3
Category
Article
ISSN
1071-5797

No coin nor oath required. For personal study only.

✦ Synopsis


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 the general case. We also prove a bound on the number of points of an algebraic set of given codimension and degree. We also discuss an application of our results to coding theory, namely to the problem of computing generalized Hamming weights for q-ary projective Reed-Muller codes.


📜 SIMILAR VOLUMES


On the number of positive solutions of e
✍ Donal O'Regan; Haiyan Wang 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB

## Abstract The paper deals with the existence, multiplicity and nonexistence of positive radial solutions for the elliptic system div(|∇|^__p__ –2^∇) + __λk~i~__ (|__x__ |) __f^i^__ (__u__~1~, …,__u~n~__) = 0, __p__ > 1, __R__~1~ < |__x__ | < __R__~2~, __u~i~__ (__x__) = 0, on |__x__ | = __R__~1~

Estimations for the Separation Number of
✍ JEAN-PIERRE DEDIEU 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 359 KB

We give a lower bound for the minimum distance between two zeros of a polynomial system f in terms of the distance of f to a variety of ill-posed problems.

On the Number of Sets Definable by Polyn
✍ Gabriela Jeronimo; Juan Sabia 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 102 KB

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 polynomi