Algorithmic computation of polynomial amoebas
D.V. Bogdanov, A.A. Kytmanov, T.M. Sadykov

TL;DR
This paper introduces algorithms for computing and visualizing polynomial amoebas, including methods for handling complex topologies and implementations in Matlab and Mathematica.
Contribution
It provides novel algorithms for computing and visualizing amoebas and their topologies, including a method for generating polynomials with maximally complex amoeba topologies.
Findings
Algorithms successfully compute and visualize amoebas and their contours.
Implementation in Matlab and Mathematica enables practical use.
Method for generating polynomials with complex amoeba topology demonstrated.
Abstract
We present algorithms for computation and visualization of amoebas, their contours, compactified amoebas and sections of three-dimensional amoebas by two-dimensional planes. We also provide method and an algorithm for the computation of~polynomials whose amoebas exhibit the most complicated topology among all polynomials with a fixed Newton polytope. The presented algorithms are implemented in computer algebra systems Matlab 8 and Mathematica 9.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Advanced Numerical Analysis Techniques · Computational Geometry and Mesh Generation
