Solving Equivalence of Recurrent Sequences in Groups by Polynomial Manipulation

Article type: Research Article

Authors: Ruohonen, Keijo

Affiliations: Department of Mathematics, Tampere University of Technology, 33101 Tampere, Finland. ruohonen@cc.tut.fi

Note: [] Address for correspondence: Department of Mathematics, Tampere University of Technology, 33101 Tampere, Finland.

Abstract: Methods are described for reducing the equivalence problem for sequences defined by recurrence equations in various finitely generated groups to polynomial Gröbner basis constructions. The methods are simple enough to allow a straigthforward implementation in computer algebra programs.

Keywords: recurrences in groups, equivalence problem, polynomial manipulation

DOI: 10.3233/FI-1999-381211

Journal: Fundamenta Informaticae, vol. 38, no. 1-2, pp. 135-148, 1999