Computing affine equivalences and symmetries of trigonometric curves in arbitrary dimension

Abstract

We present a new and efficient algorithm to compute affine equivalences and symmetries between two trigonometric curves in an arbitrary dimension. The algorithm benefits from the power of invariance and polynomial gcd and factoring without solving any system of equations. The algorithm is implemented in MAPLE, and extensive experimentations demonstrating the efficiency of the method are given.