2022-10-29 18:31:51 +0100 | asked a question | How to control which representative is chosen in quotient of multivariate polynomial ring How to control which representative is chosen in quotient of multivariate polynomial ring I have a ring, S, with generat |

2022-06-29 18:32:42 +0100 | asked a question | Creating a polynomial from a string with symbolic constants Creating a polynomial from a string with symbolic constants Below is some code that does the following. First, define R |

2022-06-29 17:26:37 +0100 | marked best answer | LMFDB Code for p-adic extensions gives NotImplementedError I downloaded the Sage code from this page, which is supposed to give me all quartic extensions of the 2-adic integers. When I try to run the code, it gives me the error: A mwe for the error is given by the following code: I am using SageMath 9.6, which I believe is the latest version, so it seems strange that code from the LMFDB would be giving me this error, since presumably they tested it before putting it up. Can anyone advise me on getting around this or fixing it? |

2022-06-29 17:26:37 +0100 | received badge | ● Scholar (source) |

2022-06-29 13:36:40 +0100 | received badge | ● Nice Question (source) |

2022-06-28 13:54:17 +0100 | received badge | ● Editor (source) |

2022-06-28 13:54:17 +0100 | edited question | LMFDB Code for p-adic extensions gives NotImplementedError LMFDB Code for p-adic extensions gives NotImplementedError I downloaded the Sage code from this page, which is supposed |

2022-06-28 13:54:05 +0100 | asked a question | LMFDB Code for p-adic extensions gives NotImplementedError LMFDB Code for p-adic extensions gives NotImplementedError I downloaded the sage code from this page, which is supposed |

2022-04-08 23:26:55 +0100 | received badge | ● Student (source) |

2022-04-08 23:26:04 +0100 | asked a question | Reducing an expressing modulo a variable expression Reducing an expressing modulo a variable expression I have some integer matrices, and I am interested in their behaviour |

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.