Yes, I should have mentioned my question on ask.sagemath.org.
Jason, Your answer there seems to work as required, thanks.
I've responded there as well, with what I hope supplements my answer
above. Please ask for more detail if you need it--it would be very good
to improve the documentation
On Sep 2, 3:33 am, Bruce brucewestb...@gmail.com wrote:
I am trying to construct the fee module on the set of instances of a
class G.
It would be good to give a complete example, that is, with a
particular G.
Can anyone tell me what I am doing wrong and/or explain this?
Thanks
--
You
O.K. Then a minimal example to start with would be
class G:
blah = 0
f = G()
g = G()
On Sep 2, 3:00 pm, bump b...@match.stanford.edu wrote:
On Sep 2, 3:33 am, Bruce brucewestb...@gmail.com wrote:
I am trying to construct the fee module on the set of instances of a
class G.
It would
Hi Florent
I am not sure if you mean it is a bug that a + b works or that 2*a
doesn't.
The documentation describes a Parent as a set. In these terms the
Parent
I want is the set of instances of the class G. I don't know how to
construct
this as a Parent or even if this is allowed.
On Sep 2,
I have played around following Florent's comment and the following
seems to work
(while at the same time displaying my ignorance)
class G:
blah = 0
f =G()
g=G()
p=parent(f)
M=CombinatorialFreeModule(QQ,p)
a=M.monomial(f)
b=M.monomial(g)
(2/3)*a+(4/5)*b
--
You received this message
Hi Bruce,
Incidentally, the following works for me, with sage 4.5.2, which I think
was your minimal counter-example. Did I misunderstand? What version of
sage are you using?
sage: class G:
: blah = 0
:
sage: f = G()
sage: g = G()
sage: M = CombinatorialFreeModule(QQ, G)
sage: a =
On Sep 2, 3:33 am, Bruce brucewestb...@gmail.com wrote:
I am trying to construct the free module on the set of instances of a
class G.
Did you also ask this on ask.sagemath.org? I've posted some possibly
related ideas in the thread http://ask.sagemath.org/question/94/using-
