#15714: implement CFiniteSequence
-------------------------------------+-------------------------------------
Reporter: rws | Owner: rws
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.2
Component: combinatorics | Resolution:
Keywords: recurrence, | Merged in:
sequence, ogf | Reviewers:
Authors: rws | Work issues:
Report Upstream: N/A | Commit:
Branch: | a2d51160c58a3466426575b3cf9f724bb6fe66bd
u/rws/ticket/15714 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Changes (by rws):
* status: needs_work => needs_review
Comment:
I refrained from creating a specific parent, as the ring is isomorphic to
Laurent polynomial fractions. I specifically allowed `ZZ` and `QQ`. So
C-finite sequences return their parent as `Fraction Field of Univariate
Polynomial Ring in x over Rational Field`.
Two guessing algorithms are implemented, Berlekamp-Massey and LLL
(faster,default).
An improvement in clarity could be to replace the internal implementation
via vanilla polyniomals by Laurent polyniomals (#11726).
I think the math is pretty standard, though I know of no paper about the
isomorphism. If I knew algebra better I would write a paper.
--
Ticket URL: <http://trac.sagemath.org/ticket/15714#comment:15>
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.
