2024-07-30 09:35:59 +0100 | received badge | ● Famous Question (source) |

2024-07-30 09:35:59 +0100 | received badge | ● Notable Question (source) |

2024-07-30 09:35:59 +0100 | received badge | ● Popular Question (source) |

2024-04-30 13:27:55 +0100 | received badge | ● Notable Question (source) |

2022-05-22 21:12:05 +0100 | commented answer | Galois Field tower field representation That product should produce the 14th element, so b+a+1, according to what i'm looking for. |

2022-05-21 10:08:17 +0100 | commented answer | Galois Field tower field representation I should have been clearer, when i speak about numbers i mean their representation in that specific field: one can get e |

2022-05-18 13:36:19 +0100 | received badge | ● Supporter (source) |

2022-05-18 13:36:15 +0100 | commented answer | Galois Field tower field representation It seems to almost work correctly, i get the expected behaviour when summing together elements of such fields, but not w |

2022-05-17 23:11:44 +0100 | received badge | ● Popular Question (source) |

2022-05-17 23:10:22 +0100 | asked a question | Galois Field tower field representation Galois Field tower field representation I'm trying to create some galois field (GF4, GF16 and GF256) using a tower field |

2020-09-05 10:52:41 +0100 | received badge | ● Teacher (source) |

2020-09-04 10:30:55 +0100 | answered a question | Too long to compute the Groebner basis of a not so big system Consider that there are many algorithms to compute a Groebner Base in Sage (by default you use std but there is also slimgb, etc...), and the efficiency of each one can differ by the monomial ordering you choose for your ring (in your case invlex): my suggestion is to try different combination of them, to see at least an improvement. |

2020-04-28 12:37:20 +0100 | received badge | ● Nice Question (source) |

2020-04-28 00:04:15 +0100 | received badge | ● Student (source) |

2020-04-27 22:48:15 +0100 | asked a question | RuntimeError Groebner basis for a Boolean system Hello everyone, i've started using sage for a few days and i'm having a rough time trying to use groebner basis with big boolean systems. Right now my goal is to verify the time it takes to solve these systems in this way: keep in mind that these equation are extracted from a cipher, and they are roughly 150 for 130 variables. The thing is that when i try to call the method 'variety' on the ideal 'I', i get a runtime error (even with this reduced example): Do you have any idea why this happens? Or if you have any suggestions with the approach i could take, i'm happy to listen to them. Thank you in advance for your time. |

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.