The C-finite Ansatz

Details The C-finite Ansatz The C-finite Ansatz

2011-07-18

arxiv.org/abs/1107.3473v1

Mathematics

Combinatorics

Dedicated to Mourad Ismail and Dennis Stanton

Scientific paper

While it is trivial to multiply two C-finite sequences (just like integers), it is not quite so trivial to "factorize" them, or to decide whether they are "prime". The former is plain linear algebra, while the latter is heavy-duty non-linear algebra, getting hairy systems of algebraic equations that can be solved, in principle, using Gr\"obner bases and the Buchberger algorithm, but, alas, sooner or later it becomes too hard even for the fastest and largest computers. The main technical novely of this article is a fast "algorithm" (it cheats and uses floating-point arithmetic, please don't tell anyone!) for deciding whether a given C-finite sequence can be written as a product of C-finite sequences of lower order. This article accompanies the Maple package Cfinite available from http://www.math.rutgers.edu/~zeilberg/tokhniot/Cfinite .

Affiliated with

Also associated with

No associations

Rating

The C-finite Ansatz does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The C-finite Ansatz, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The C-finite Ansatz will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-271874