2023-07-30 21:11:03 +0100 | commented answer | Trouble transforming a groebner basis Thank you so much Ricardo. Regarding your note about using libSingular: Am I interpreting the situation correctly if I'm |
2023-07-30 21:08:40 +0100 | commented answer | Trouble transforming a groebner basis @rburing, just FYI, I opened an issue relating to converting back the polynomias to Sage using ._sage_() here: https://g |
2023-07-30 18:23:18 +0100 | commented answer | Trouble transforming a groebner basis Thank you so much Ricardo. Regarding your note about using libSingular: I'm I interpreting the situation correctly if I' |
2023-07-30 18:20:55 +0100 | marked best answer | Trouble transforming a groebner basis I'm using sage to compute Gröbner bases (in lexicographic order) over a fractional field. This has been working out well so far. For computational efficiency I've read that degrevlex order is often preferred for the initial basis calculation, followed by a transformation (using the FGLM algorithm) to the desired order (lex in my case). However, I'm facing a problem when I try to transform the basis, my invocation might be wrong, but currently this is yielding me a This is the and this is my backtrace: Any clue as to what I might be doing wrong? I'm using sage 9.5, provided by Debian 12 (bookworm) |
2023-07-30 18:20:55 +0100 | received badge | ● Scholar (source) |
2023-07-30 18:20:54 +0100 | received badge | ● Supporter (source) |
2023-07-30 11:33:00 +0100 | received badge | ● Student (source) |
2023-07-30 08:52:14 +0100 | asked a question | Trouble transforming a groebner basis Trouble transforming a groebner basis I'm using sage to compute Gröbner bases (in lexicographic order) over a fractional |