Computing amoebas

Experimental Mathematics

Volumn 11, Issue 4, 2002, Pages 513-526

  Theobald, Thorsten ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Amoebas; Grassmannian; Homotopy continuation methods; Ideals; Laurent polynomials; Varieties

Indexed keywords

EID: 0038445303     PISSN: 10586458     EISSN: 1944950X     Source Type: Journal    
DOI: 10.1080/10586458.2002.10504703     Document Type: Article

References (23)

1. Ph. Aubry, F. Rouillier, and M. Safey El Din. “Real Solving for Positive Dimensional Systems.” J. Symb. Comp. 34 (2002), 543-560.
2. M. Ben-Or, D. Kozen, and J. Reif. “The Complexity of Elementary Algebra and Geometry.” J. Computer and System Sciences 32 (1986), 251-264.
3. M. Burundu and M. Stillman. “Computing the Equations of a Variety.” Trans. Am. Math. Soc. 337 (1993), 677-690.
4. G.E. Collins. “Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition.” In Proc. Automated Theory and Formal Languages, pp. 134-183, Lecture Notes in Computer Science vol. 33. Berlin: Springer-Verlag, 1975.
5. D. Cox, J. Little, and D. O’Shea. Ideals, Varieties, and Algorithms, 2nd edition. New York: Springer- Verlag, 1996.
6. D. Cox, J. Little, and D. O’Shea. Using Algebraic Geometry, Graduate Texts in Mathematics, Volume 185. New York: Springer-Verlag, 1998.
7. M. Einsiedler, D. Lind, R. Miles, and T. Ward. “Expansive Subdynamics for Algebraic 7Ld- Actions. Ergodic Theory and Dynamical Systems 21 (2001), 1695-1729.
8. D. Eisenbud. “Projective Geometry and Homological Algebra.” In Computations in Algebraic Geometry with Macaulay 2, edited by D. Eisenbud, D. Grayson, M. Stillman, and B. Sturmfels. Berlin: Springer-Verlag, 2001.
9. M. Forsberg, M. Passare, and A. Tsikh. “Laurent Determinants and Arrangements of Hyperplane Amoebas.” Adv. Math. 151 (2000), 45-70.
10. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
11. I. M. Gel'fand, M. M. Kapranov, and A. V. Zelevinsky. Discriminants, Resultants, and Multidimensional Determinants. Noston, MA: Birkhauser Boston Inc., 1994.
12. D. R. Grayson and M. E. Stillman. Macaulay 2. A Software System for Research in Algebraic Geometry and Commutative Algebra. Available from World Wide Web: (http://www.math.uiuc.edu/Macaulay2/), 2001.
13. D. Y. Grigor'ev and N. N. Vorobjov, Jr. “Solving Systems of Polynomial Inequalities in Subexponential Time.” J. Symb. Comp. 5 (1988), 37-64.
14. W. Hodge and D. Pedoe. Methods of Algebraic Geometry, Volume 1. Cambridge: Cambridge University Press, 1947.
15. G. Mikhalkin. “Real Algebraic Curves, the Moment Map and Amoebas.” Ann. of Math. 151 (2000), 309-326
16. G. Mikhalkin and H. Rullgård. “Amoebas of Maximal Area.” Intemat. Math. Res. Notices (2001), 441-451.
17. M. Passare and H. Rullgård. Amoebas, Monge-Ampere Measures and Triangulations of the Newton Polytope. Research Report No. 10, Stockholm University, 2000.
18. W.-D. Ruan. Newton Polygon and String Diagram. Available from World Wide Web: (www.arXiv.org/abs/math.DG/0011012), 2000.
19. H. Rullgård, “Polynomial Amoebas and Convexity.” Ph.D. diss. Stockholm University, 2001, available as Research Report No. 8, 2001.
20. B. Sturmfels. Grobner Bases and Convex Polytopes, American Mathematical Society, Providence, RI, 1996.
21. B. Sturmfels. Solving Systems of Polynomial Equations, to appear in the CBMS series of the AMS, 2002.
22. A. Tarski. A Decision Method for Elementary Algebra and Geometry, 2nd edition. Berkeley, CA: University of California Press, 1951.
23. J. Verschelde. “PHC pack: A General- Purpose Solver for Polynomial Systems by Homotopy Continuation.” ACM Trans. Math. Software (1999), 251-276.