#15852: make Sequence a FiniteEnumeratedSets
-------------------------------------+-------------------------------------
Reporter: rws | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.2
Component: categories | Resolution:
Keywords: | Merged in:
Authors: Ralf Stephan | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/rws/ticket/15852 | c0f4cf53bd33fa88e375a632454a81ce1954a4e1
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by tscrim):
A parent in `EnumeratedSets` is a set whose elements can be enumerated. So
the parent, the set of all sequences, must be enumerable, not the
sequences themselves. I'm not convinced of a ring structure, much less a
natural one. What is the addition and multiplication operations? I would
want addition to be concatenation given the python syntax. I'm not sure at
a quick glance that this would give a module structure when the base
object has a ring structure (which it may not).
Although since the present class is for finite sequences, I agree that
infinite sequences should be done on another ticket.
--
Ticket URL: <http://trac.sagemath.org/ticket/15852#comment:6>
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/groups/opt_out.