𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a Lower-Bound for the Absolute Value of a Polynomial of Several Complex Variables

✍ Scribed by B. Paneah


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
268 KB
Volume
78
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

✦ Synopsis


For an arbitrary polynomial (P\left(z_{1}, z_{2}, \ldots, z_{n}\right)) in complex space (\mathbb{C}^{n}) we describe a set of nonnegative multi-indices (\alpha=\left(\alpha_{1}, \alpha_{2}, \ldots, \alpha_{n}\right)) such that for any (n)-tuple (\delta=\left(\delta_{1}, \delta_{2}, \ldots, \delta_{n}\right) \geq 0) (where (\delta_{j}=0) if (\alpha_{j}=0) ), one can find a system of "thin" sets (M_{j}) of widths (\leq \delta_{j}) in directions of the axes (z_{j}), respectively, (1 \leq j \leq n), for which outside their union the absolute value of a polynomial is bounded away from zero by ((\delta / \alpha)^{\alpha} \Gamma_{\alpha}\left(\Gamma_{\alpha}\right.) depends on (P) but not on (\delta) ). The prototype of this result is the well known Cartan's Theorem on a lower bound for the modulus of a polynomial (P(z), z \in \mathbb{C}^{1} . \quad \mathbb{C} 1994) Academic Press, inc.


πŸ“œ SIMILAR VOLUMES


Lower Bounds for the Complexity of Funct
✍ Nader H. Bshouty πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 127 KB

This paper develops a new technique that finds almost tight lower bounds for the complexity of programs that compute or approximate functions in a realistic RAM model. The nonuniform realistic RAM model is a model that uses the arithmetic Γ„ 4 operations q, y, = , the standard bit operation Shift, Ro