Hi all,
I am having a bit of a hard time wrapping my head around how I am supposed
to define the basis keys that are required for creating a combinatorial
free module.
The kind of basis keys with which I would like to label the basis of my
free module is the set of "all tuples, of any length, of elements in some
set S".
So for example, if the set is S = { 1, 2 }, then the set of tuples would
contain
(), (1,), (2,), (1,2), (2,1), ... and so on.
Is there an easy way to define such a set of tuples?
The actual sets S that I would like to work with are a bit more complicated
than the one above, in particular they have an ordering and it would be
nice to be able to check if the sequence of elements in a tuple is in
order. Also the sets S need not be finite.
Any help and pointers to helpful documentation would be greatly appreciated.
Best,
Simon
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-combinat-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
Visit this group at https://groups.google.com/group/sage-combinat-devel.
For more options, visit https://groups.google.com/d/optout.
