Solving Equivalence of Recurrent Sequences in Groups by Polynomial Manipulation

  • Authors:

  • Keijo Ruohonen

  • Affiliations:

  • (Correspd.) Department of Mathematics, Tampere University of Technology, 33101 Tampere, Finland. ruohonen@cc.tut.fi

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

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.