𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Estimations for the Separation Number of a Polynomial System

✍ Scribed by JEAN-PIERRE DEDIEU


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
359 KB
Volume
24
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis


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.


📜 SIMILAR VOLUMES


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

Separation of estimation and control for
✍ Tsuneo Yoshikawa; Hiroaki Kobayashi 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 427 KB

A sufficient condition is given for a separation of estimation and control in decentralized discrete-time stochastic control systems. It is shown that the one-step delay sharing system is a special case satisfying this condition. A counterexample is given, however, to the conjecture that the separat

Approximating the Number of Zeroes of a
✍ M. Karpinski; M. Luby 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 325 KB

We develop a probabilistic polynomial time algorithm which on input a polynomial \(g\left(x_{1}, \ldots, x_{n}\right)\) over \(G F[2], \epsilon\) and \(\delta\), outputs an approximation to the number of zeroes of \(g\) with relative error at most \(\epsilon\) with probability at least \(1-\delta\).