Home | Trees | Index | Help |
|
---|
Package sage :: Package modular :: Package modsym :: Module heilbronn :: Class Heilbronn |
|
object
--+
|
Heilbronn
HeilbronnCremona
,
HeilbronnMerel
Method Summary | |
---|---|
x.__getitem__(y) <==> x[y] | |
x.__len__() <==> len(x) | |
T.__new__(S, ...) -> a new object with type S, a subtype of T | |
Return a list of pairs ((c,d),m), which is obtained as follows: 1) Compute the images (a,b) of the vector (u,v) (mod N) acted on by each of the HeilbronnCremona matrices in self. | |
to_list(...)
| |
Inherited from object | |
x.__init__(...) initializes x; see x.__class__.__doc__ for signature | |
x.__delattr__('name') <==> del x.name | |
x.__getattribute__('name') <==> x.name | |
x.__hash__() <==> hash(x) | |
helper for pickle | |
helper for pickle | |
x.__repr__() <==> repr(x) | |
x.__setattr__('name', value) <==> x.name = value | |
x.__str__() <==> str(x) |
Method Details |
---|
__getitem__(x,
y)
x.__getitem__(y) <==> x[y]
|
__len__(x)
x.__len__() <==> len(x)
|
__new__(T, S, ...)T.__new__(S, ...) -> a new object with type S, a subtype of T
|
apply(...)Return a list of pairs ((c,d),m), which is obtained as follows: 1) Compute the images (a,b) of the vector (u,v) (mod N) acted on by each of the HeilbronnCremona matrices in self. 2) Reduce each (a,b) to canonical form (c,d) using p1normalize 3) Sort. 4) Create the list ((c,d),m), where m is the number of times that (c,d) appears in the list created in steps 1--3 above. Note that the pairs ((c,d),m) are sorted lexicographically by (c,d). |
Home | Trees | Index | Help |
|
---|
Generated by Epydoc 2.1 on Wed May 4 18:06:57 2005 | http://epydoc.sf.net |