#10530: De Bruijn Sequence construction for combinat
---------------------------------+------------------------------------------
Reporter: eviatarbach | Owner: eviatarbach
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-4.7
Component: combinatorics | Keywords:
Work_issues: | Upstream: N/A
Reviewer: Nicolas M. Thiéry | Author: Eviatar Bach
Merged: | Dependencies:
---------------------------------+------------------------------------------
Comment(by eviatarbach):
The contains method is great!
Sorry about the wrong algorithm. It looks like I was using an outdated
revision to make the last patch.
As for the case when k=0 and length 0, I assume you mean k=1 and length 1?
I do not think this is correct, as it is a cyclic sequence. Therefore, a
De Bruijn sequence [0] would include any substring of length n for
alphabet [0]. This can also be verified by the length formula k^n: 1^n=1.
I assumed that I had to split the Cython code from Python. I guess it
would be easier to have it all in one file. I will do so.
Other than some minor grammatical errors everything else seems good. Thank
you very much for the improvements!
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10530#comment:25>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
