Guardat en:
| Autor principal: | |
|---|---|
| Format: | Preprint |
| Publicat: |
2002
|
| Matèries: | |
| Accés en línia: | https://arxiv.org/abs/math/0212309 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
Taula de continguts:
- We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in algebraic geometry or convex geometry. Highlights include the following: (1) A completely self-contained proof of an extension of Bernstein's Theorem. Our extension relates volumes of polytopes with the number of connected components of the complex zero set of a polynomial system, and allows any number of polynomials and/or variables. (2) A near optimal complexity bound for computing mixed area -- a quantity intimately related to counting complex roots in the plane.