Thanks for the clarification. Let me restate it to check I am having
it right. You have a poset, say:
sage: P = Poset((divisors(30), attrcall(divides)))
and then you want to manipulate a bunch of linear extensions of that
poset like::
sage: l1 = [1, 5, 3, 2, 10, 6, 15, 30]
Hi!
class LinearExtensionOfPoset(CombinatorialObject, Element):
...
We want to deprecate CombinatorialObject as soon as possible. If at
all possible, please use ClonableArray (if not ClonableIntArray). See:
sage: sage.structure.list_clone?
Here, the ``def check(self)``
On Tue, Feb 14, 2012 at 02:05:21PM -0800, Anne Schilling wrote:
No. It is really a different poset, see:
...
which returns the original poset. But to_poset gives Q from the above
computation.
Ok; out of curiosity, why do you need the relabelled poset for?
The elements of L would simply be
I tried to do some computations with the existing Iwahori-Hecke
algebra module inside sage earlier this year. I needed to work over
the rational function field C(x), for an indeterminate x. In the end I
gave up and went back to using some gap3 code that I have, which
builds on chevie, because it
