commit a0583db3d4e8df68ec17f1a72c5a74c012b30b37
parent 5bf4cde26ce9c3edc0a3f007714b3690f397b286
Author: Sebastiano Tronto <sebastiano.tronto@gmail.com>
Date: Fri, 20 Sep 2019 10:52:07 +0200
New documentation
Diffstat:
1 file changed, 9 insertions(+), 1 deletion(-)
diff --git a/README.md b/README.md
@@ -29,18 +29,26 @@ generators can slow the script as well.
* The code is very fast for groups of small rank (e.g. up to 5) and generated
by elements of magnitude 10^6; higher ranks are feasible as well with smaller
generators.
+* The complexity of the calculation of a call of KummerDegree(G,M,N) does not
+depend on M and N.
## KummerDegree( G, M, N )
Returns the degree of the Kummer extension Q_{M,N}. Again, G is given simply as a list of generators and it may contain torsion.
-Example:
+Examples:
+
```
sage: KummerDegree([-36,12,-1],120,24)
4608
```
+```
+sage: KummerDegree([144,27,49/81,-1/125,121/13],36*10^6,36*10^6)
+1007769600000000000000000000000000000000000
+```
+
## TotalKummerFailure( G )
Outputs the description of the failure of maximality for all possible values of M and N. Here G is given as a list of generators (not necessarily a basis). G can also contain torsion. If G = <-1>, the program stops immediately.
