2023-06-08 18:29:51 +0200 | received badge | ● Famous Question (source) |

2022-10-30 13:18:47 +0200 | received badge | ● Notable Question (source) |

2022-06-24 21:25:30 +0200 | received badge | ● Notable Question (source) |

2022-02-06 15:48:08 +0200 | received badge | ● Popular Question (source) |

2021-04-13 10:52:00 +0200 | received badge | ● Popular Question (source) |

2021-02-04 10:30:42 +0200 | commented question | Sage crash when computing variety for an ideal with many variables @rburing I understand that the Groebner basis is a set of polynomials then equated to 0 the solutions to these equations are the variety that I want. But Sage's variety function doesn't allow to choose which algorithm to use to calculate the Groebner basis. I can compute the Groebner basis with either |

2021-02-03 20:48:28 +0200 | received badge | ● Nice Question (source) |

2021-02-03 19:40:03 +0200 | commented question | Sage crash when computing variety for an ideal with many variables @rburing Thank you for your comment, the code in my questions fails as expected now. If I understand right, the last three lines should be changes as you suggested. |

2021-02-03 18:59:18 +0200 | commented question | Sage crash when computing variety for an ideal with many variables How do I that? |

2021-02-02 13:04:30 +0200 | asked a question | Sage crash when computing variety for an ideal with many variables I try to run a code (on a Jupyter notebook) which computes the variety of an ideal for some polynomial in many variables (64 for in this case. Notice I solve for This is the code: |

2021-01-28 09:20:12 +0200 | commented answer | Solve for coefficients of polynomials @tmonteil I changed the names as you suggested, I got another error (my question was updeated) |

2021-01-27 18:34:30 +0200 | received badge | ● Editor (source) |

2021-01-27 18:13:17 +0200 | received badge | ● Student (source) |

2021-01-27 17:53:43 +0200 | asked a question | Solve for coefficients of polynomials I want to solve for the coefficients $\alpha(n, m, k)$ an equation that looks like this: $$ 0 = (1 + x + y + z) \sum_{n, m, k \in \{0, 1, \dots, N\}} \alpha(n, m, k) x^n y^m z^k $$ where $\alpha(n, m, k) \in \{0, 1\}$ and $x^n y^m z^k$ are polynomials over $\mathbb{F}_2$ that satisfy $x^L = y^L = z^L = 1$ for some integer $L$. Is there a way to do this in Sage? Notice there are three generators $x,y,$ but the number of coefficents $\alpha$ is $2^{3L}$. I tried to follow this answer and wrote this code that failed- And I get the following error: |

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.