Lopsided Approximation of Amoebas

08/30/2016
by   Jens Forsgård, et al.
0

The amoeba of a Laurent polynomial is the image of the corresponding hypersurface under the coordinatewise log absolute value map. In this article, we demonstrate that a theoretical amoeba approximation method due to Purbhoo can be used efficiently in practice. To do this, we resolve the main bottleneck in Purbhoo's method by exploiting relations between cyclic resultants. We use the same approach to give an approximation of the Log preimage of the amoeba of a Laurent polynomial using semi-algebraic sets. We also provide a SINGULAR/SAGE implementation of these algorithms, which shows a significant speedup when our specialized cyclic resultant computation is used, versus a general purpose resultant algorithm.

READ FULL TEXT
research
08/25/2021

On the extremal values of the cyclic continuants of Motzkin and Straus

In a 1983 paper, G. Ramharter asks what are the extremal arrangements fo...
research
04/05/2022

Theoretical analysis of the extended cyclic reduction algorithm

The extended cyclic reduction algorithm developed by Swarztrauber in 197...
research
06/01/2021

On cyclic algebraic-geometry codes

In this paper we initiate the study of cyclic algebraic geometry codes. ...
research
02/09/2019

Skew-Polynomial Rings and Skew-Cyclic Codes

This is a survey on the theory of skew-cyclic codes based on skew-polyno...
research
10/26/2011

Sufficient FTP Schedulability Test for the Non-Cyclic Generalized Multiframe Task Model

Our goal is to provide a sufficient schedulability test -ideally polynom...
research
12/28/2021

A Generalization of Cyclic Code and Applications to Public Key Cryptosystems

In this paper, we define and discuss ϕ-cyclic code, which may be regarde...
research
09/08/2020

Dual optimal design and the Christoffel-Darboux polynomial

The purpose of this short note is to show that the Christoffel-Darboux p...

Please sign up or login with your details

Forgot password? Click here to reset