Let m be a modular symbol for the congruence subgroup G=Gamma0(N) for
some N.
If one assumes m is cuspidal, there exist elements g in G such that m
is equivalent to the symbol {0,g(0)}.
How can I compute one such g with sage? If possible, I'd like to find
g with as small coefficients as possible. I'd particularly interested
in finding g=[[a,b],[c,d]] with c small.
If m={c1,c2} then we can just type
G.are_equivalent_cusps(c1,c2,trans=True) and the answer is True,
because cuspidality means that c1 and c2 are equivalent cusps under G.
How can we compute g when, say, m={c1,c2}+{c3,c4} is cuspidal but c1
is not equivalent to c2, and c3 is not equivalent to c4? Is there an
optimal way of computing it?
--
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/sage-support
URL: http://www.sagemath.org
