From a0583db3d4e8df68ec17f1a72c5a74c012b30b37 Mon Sep 17 00:00:00 2001 From: Sebastiano Tronto Date: Fri, 20 Sep 2019 10:52:07 +0200 Subject: New documentation --- README.md | 10 +++++++++- 1 file changed, 9 insertions(+), 1 deletion(-) (limited to 'README.md') diff --git a/README.md b/README.md index 267f6e7..a376912 100644 --- 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. -- cgit v1.3