Is there a way to produce an orbit of a chain in a poset (whose elements are sets of sets) (that is, the group action is a group acting on the order complex of a poset)?
I really want something that looks like this:
G.orbit(Z[0], action = "OnSetsSetsSets") or perhaps OnTuplesSetsSets
Is there a workaround where I might be able to use just OnSets? Perhaps using lambda in some way?
As mentioned before, you could implement your own function. (Call
Print(OnSetsSets)to get an idea how a putativeOnSetsSetsSetsetc. would have to look like.) However at some point you pay a price in time and memory for the indirections.What I would do is to create an action of the group on sets of sets. For example (say the sets of sets can be seeded with orbits of a and b):
Then every sets of sets is an element of
domainand thus a number forh. A chain would be a set of such numbers and you could get orbits by lettinghactOnSets, usingdomainto translate back to your original representation.Concerning you comment question about
cloudsageI have no clue, never having used it. Installing GAP is not hard and probably worth doing if you have any nontrivial calculation, rather than relying on a cloud platform.