On Saturday, December 18, 2010, victor wrote:
> Is the intersection pairing on modular symbols implemented in Sage?
No. Somebody should implement it. Follow the code i wrote in Magma
and Merel's paper on this...
> That is, if I have two modular symbols m and n, corresponding to
> homology clas
On Saturday, December 18, 2010 11:16:33 AM UTC+1, john_perry_usm wrote:
>
> sage: S = set([0,1,2])
> sage: U_S = S.subset(lambda x: x.is_unit()); U_S
> >> 1
>
> It seems like this should be doable in a straightforward way.
>
Python has functional-programming aspects. If you are not afraid of t
sage: S = set([0,1,2])
sage: set(x for x in S if x.is_unit())
set([1])
Use "Set" instead of "set" for Sage-sets (as opposed to pure python sets).
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googleg
Is the intersection pairing on modular symbols implemented in Sage?
That is, if I have two modular symbols m and n, corresponding to
homology classes on a modular curve, can I compute the intersection
product m.n of the two classes?
For instance:
sage:
M=ModularSymbols(37);
m = M.modular_symbol(
Hi
Is there a simple way of creating a quantified subset of a set? I'm
looking for something along the lines of,
sage: S = set([0,1,2])
sage: U_S = S.subset(lambda x: x.is_unit()); U_S
>> 1
It seems like this should be doable in a straightforward way.
regards
john perry
--
To post to this gro
