#18709: closed forms of C-finite sequences
-------------------------------------+-------------------------------------
Reporter: rws | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.8
Component: commutative | Resolution:
algebra | Merged in:
Keywords: | Reviewers:
Authors: Ralf Stephan | Work issues:
Report Upstream: N/A | Commit:
Branch: | f643cb401dec648fe0bc601573a5b019d58676ea
u/rws/closed_forms_of_c_finite_sequences| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by rws):
Vincent, you probably read the word `fibonacci`, but did you notice that
in `binary_recurrence_sequences.py` only a small part of C-finite
sequences is treated, ie those of degree 2? Have you noticed that our
implementation can guess a sequence from the numbers? And with this ticket
you get a closed form for immediate and fast evaluation of any binary or
other recurrence.
As to your question about the ring of C-finite sequences I refer you to
{{{
.. [Z11] Zeilberger, Doron. "The C-finite ansatz." The Ramanujan Journal
(2011): 1-10.
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/18709#comment:5>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
