Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
| 2024-03-02 19:39:08 +0200 | received badge | ● Popular Question (source) |
| 2021-06-23 21:50:57 +0200 | received badge | ● Good Question (source) |
| 2021-02-22 23:37:00 +0200 | answered a question | what does it mean- E[0] on elliptic curve ? E[0] is the infinity point of the curve, i.e. (0:1:0). More generally, you can get points (defined over F) using the square brackets: E[i]. The class is implemented such that E[0] will be always the infinity point. It is hard to calculate the points of elliptic curve over large fields so it will take some time to display E[0] even though we know it will be the infinity point. |
| 2021-02-20 00:08:47 +0200 | received badge | ● Nice Question (source) |
| 2021-02-19 15:16:47 +0200 | received badge | ● Student (source) |
| 2021-02-19 14:49:45 +0200 | asked a question | Groebner basis over large finite fields. 1) I would like to compute groebner basis of an ideal in GF(p)[x] where p has roughly 100bits. However, Singular doesn't support such large finite fields so it always falls back on the slow toy implementation of Buchberger. Are there any better options than the toy implementation? 2) Ideally (pun intended), I would like to use the .elimination_ideal method but this uses only Singular, so again no use for me, or is there any workaround? It seems to me that because of the limitations of Singular, Sage practically doesn't support groebner basis algorithms over large finite fields which seems like a huge limitation for me. Am I missing something? I do not have magma but I suppose I could install macaulay2 and use it with sage but is it better than the toy implementation? |
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.