#15820: Implement sequences of bounded integers
--------------------------------------------------+------------------------
Reporter: SimonKing | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.2
Component: algebra | Resolution:
Keywords: quiver path algebra efficiency | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #12630 | Stopgaps:
--------------------------------------------------+------------------------
Description changed by SimonKing:
Old description:
> #12630 has introduced tools to compute with quiver algebras and quiver
> representations. It is all Python code, paths being internally stored by
> lists of labelled edges of digraphs.
>
> The aim of this ticket is to provide a more efficient implementation of
> the (partial) semigroup that is formed by the paths of a quiver,
> multiplied by concatenation.
New description:
#12630 has introduced tools to compute with quiver algebras and quiver
representations. It is all Python code, paths being internally stored by
lists of labelled edges of digraphs.
The aim of this ticket is to provide an efficient implementation of lists
of bounded integers, with concatenation. This can be used to implement
paths of a quiver more efficiently, but can also have different
applications (say, elements of free groups, or other applications in sage-
combinat).
--
--
Ticket URL: <http://trac.sagemath.org/ticket/15820#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/groups/opt_out.
