#18565: sequences in SageMath
-------------------------------------+-------------------------------------
       Reporter:  dkrenn             |        Owner:
           Type:  enhancement        |       Status:  new
       Priority:  major              |    Milestone:  sage-6.8
      Component:  combinatorics      |   Resolution:
       Keywords:                     |    Merged in:
        Authors:  Daniel Krenn       |    Reviewers:
Report Upstream:  N/A                |  Work issues:
         Branch:                     |       Commit:
  u/dkrenn/sequences/base            |  fa5c40a727f7149fee86e893fc52f27455622929
   Dependencies:                     |     Stopgaps:
-------------------------------------+-------------------------------------
Description changed by dkrenn:

Old description:

> similar to
> {{{
>     graphs.some_graph
> }}}
> or to
> {{{
>     codes.some_code
> }}}
> (and similar), I propose to introduce
> {{{
>     sequences.some_sequence
> }}}
> which should provide a unified access point to all possible sequences in
> !SageMath. For example, there is {{{fibonacci_sequence}}} in
> {{{sage.combinat.combinat}}}, {{{binary_recurring_sequence}}} (somewhere
> in combinat) and various other code.
>
> One motivation for creating this, is to include here many sequences,
> which can be calculated term-by-term (from the previously calculated
> ones, i.e., recursively) or where the first N terms can be calculated at
> once efficiently.
> Nevertheless, it can also provide an interface to sequences, where each
> term can be calculated explicitly (without dealing with the previous
> ones).

New description:

 similar to
 {{{
     graphs.some_graph
 }}}
 or to
 {{{
     codes.some_code
 }}}
 (and similar), I propose to introduce
 {{{
     sequences.some_sequence
 }}}
 which should provide a unified access point to all possible sequences in
 !SageMath. For example, there is {{{fibonacci_sequence}}} in
 {{{sage.combinat.combinat}}}, {{{binary_recurring_sequence}}} (somewhere
 in combinat) and various other code.

 One motivation for creating this, is to include here many sequences, which
 can be calculated term-by-term (from the previously calculated ones, i.e.,
 recursively) or where the first N terms can be calculated at once
 efficiently.
 Nevertheless, it can also provide an interface to sequences, where each
 term can be calculated explicitly (without dealing with the previous
 ones).

 See the discussion on [[https://groups.google.com/forum/#!topic/sage-
 devel/L-wSCu4fXe8|sage-devel]]

--

--
Ticket URL: <http://trac.sagemath.org/ticket/18565#comment:1>
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.

Reply via email to