On Sat, Dec 25, 2010 at 04:28:36PM -0800, Eviatar wrote:
> My function implements the construction of a sequence. For example:
>
> sage: DeBruijnSequence(2,3)
> [0, 0, 0, 1, 0, 1, 1, 1]
>
> Also this:
>
> sage: DeBruijnSequence(['foo','bar'],3)
> ['foo', 'foo', 'fo
Hello,
I need for the purpose of my research fast iterator through
set-partitions of a set, let say
sage: SetPartitions(18,[3,3,3,3,3,3]).cardinality()
190590400
The actual version is not convincing in terms of speed, so I started
to rewrote a bunch of combinatorial generation using very basic cyt
Thank you,
Now that I think of it cardinality would be easy to implement; there
is a formula for it. Would it be fine to have a cardinality method but
only return one sequence?
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To post to t
