2022-11-20 17:34:10 +0200 | received badge | ● Notable Question (source) |
2022-11-20 17:34:10 +0200 | received badge | ● Popular Question (source) |
2022-06-12 12:41:54 +0200 | received badge | ● Notable Question (source) |
2020-12-14 18:35:44 +0200 | received badge | ● Popular Question (source) |
2018-06-14 19:14:30 +0200 | received badge | ● Good Question (source) |
2018-06-14 19:06:34 +0200 | commented answer | How to compute common zeros of system of polynomial equations with dimension 2? Thank you for your answer. Seems like calling variety() is much faster! Nice solution. Thanks again! |
2018-06-14 19:05:26 +0200 | received badge | ● Nice Question (source) |
2018-06-14 18:30:35 +0200 | commented question | How to compute common zeros of system of polynomial equations with dimension 2? |
2018-06-14 17:20:25 +0200 | commented question | How to compute common zeros of system of polynomial equations with dimension 2? @tmonteil: I have added some code. Currently I am experimenting with the zeros of the variety. |
2018-06-14 17:19:22 +0200 | received badge | ● Editor (source) |
2018-06-14 12:49:21 +0200 | asked a question | How to compute common zeros of system of polynomial equations with dimension 2? I have some ideal of homogenous polynomials defined over some finite field: J is the ideal of interest. However I can't call J.variety() since it is not zero dimensional. The system of equations might contain 6 or 231 polynomials in four variables: Any ideas? On request. The program computes the invariant under the group $2_{+}^{1+2\cdot2}$ homogenous polynomials of given degree. To construct the polynomials and get a list of them call: homInvar(6): |
2018-06-13 19:34:54 +0200 | received badge | ● Scholar (source) |
2018-06-13 19:34:52 +0200 | received badge | ● Supporter (source) |
2018-06-13 17:29:49 +0200 | received badge | ● Student (source) |
2018-06-13 17:27:16 +0200 | asked a question | How to iterate over finite fields In my current code I have to iterate over $GF(2^7)$ four times: In the loop I evaluate some multivariate polynomial. But this is very memory hungry. Is there any better way to do this? |