#15714: implement CFiniteSequence
-------------------------------------+-------------------------------------
Reporter: rws | Owner: rws
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: recurrence, | Merged in:
sequence, ogf | Reviewers:
Authors: Ralf Stephan | Work issues:
Report Upstream: N/A | Commit:
Branch: | 0656d07dfa6dfa57f78fb1c2cfb7572a3c842801
public/ticket/15714 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by mmezzarobba):
Replying to [comment:15 rws]:
> 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`.
I haven't looked at the new code, but I really doubt that this is a good
idea: do you really want, say, the sum of a CFiniteSequence and an integer
to return a rational function?!
--
Ticket URL: <http://trac.sagemath.org/ticket/15714#comment:30>
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.
