2025-04-06 14:12:44 +0200 | commented question | Accessing transitive groups of degree 32 in libgap It works for me. Did you try restarting SageMath (to force it to load the package anew, since the package was first load |
2025-01-31 18:48:47 +0200 | received badge | ● Nice Answer (source) |
2025-01-26 09:57:04 +0200 | commented question | Iterate over a finite quotient of a multivariate polynomial ring This could be an XY problem. Why do you want to iterate over the whole quotient ring? There could be a better way to do |
2025-01-26 09:53:39 +0200 | edited answer | Iterate over a finite quotient of a multivariate polynomial ring This is something that could be built in and made easier for users. For now, I think it needs slight manual work. A vec |
2025-01-26 09:49:04 +0200 | answered a question | Iterate over a finite quotient of a multivariate polynomial ring This is something that could be built in and made easier for users. For now, I think it needs slight manual work. A vec |
2025-01-17 23:47:30 +0200 | commented answer | Implementing linear maps and their inverses in SageMath and Magma Conceptually the code should be trying to find the preimage of an element which is in the image of a map (if I understoo |
2024-12-19 17:01:22 +0200 | commented question | Virtually all of the docs lead to 404 file not found errors Can you be more precise? |
2024-12-06 19:53:41 +0200 | answered a question | is there a bug in height pairing matrix? The construction goes like this (obtained by entering E.height_pairing_matrix?? into a SageMath session): for j in rang |
2024-11-29 11:28:04 +0200 | answered a question | Conversion from finite field to integer polynomial Here is a more natural way to do it: sage: R.<y> = PowerSeriesRing(ZZ) sage: R(b.polynomial().map_coefficients(la |
2024-11-10 20:57:35 +0200 | received badge | ● Good Answer (source) |
2024-11-06 00:04:57 +0200 | received badge | ● Nice Answer (source) |
2024-11-04 21:58:35 +0200 | answered a question | 3d plot theme default? (Threejs viewer) From the documentation of show: from sage.plot.plot3d.base import SHOW_DEFAULTS SHOW_DEFAULTS['theme'] = 'dark' |
2024-11-01 06:36:10 +0200 | received badge | ● Nice Answer (source) |
2024-10-31 08:52:17 +0200 | edited answer | Elimination didn't find the correct ideal Here's a way to do the elimination properly: R = PolynomialRing(QQ, names=['a','b','c','d','e','f','g'] + [f'm_{i}{j}' |
2024-10-31 08:50:36 +0200 | commented answer | Elimination didn't find the correct ideal Thanks @Max Alekseyev, I updated the answer making use of your hint. |
2024-10-31 08:47:48 +0200 | edited answer | Elimination didn't find the correct ideal Here's a way to do the elimination properly: R = PolynomialRing(QQ, names=['a','b','c','d','e','f','g'] + [f'm_{i}{j}' |
2024-10-30 15:49:07 +0200 | answered a question | Elimination didn't find the correct ideal Here's a way to do the elimination properly: R = PolynomialRing(QQ, names=['a','b','c','d','e','f','g'] + [f'm_{i}{j}' |
2024-09-08 14:13:23 +0200 | commented question | SageManifold expand around infinity With e.g. g[0,0].expr() which is a symbolic expression you'll be able to do more. |
2024-08-30 13:09:19 +0200 | edited question | how to get the sagemath programs related to graphs with nodes and edges how to get the sagemath programs related to graphs with nodes and edges i need to write programs to draw a graph in gr |
2024-08-30 13:08:26 +0200 | edited question | how to get the sagemath programs related to graphs with nodes and edges how to get the sagemath programs related to graphs with nodes and edges i need to write programs to draw a graph in gr |
2024-08-21 08:33:31 +0200 | commented answer | How can I generate a Bitset with a fixed capacity and random bits? Then you have to add zero padding, and the resulting code is slightly longer, though arguably a bit more readable. Feel |
2024-08-21 08:33:17 +0200 | commented answer | How can I generate a Bitset with a fixed capacity and random bits? @Max Then you have to add zero padding, and the resulting code is slightly longer, though arguably a bit more readable. |
2024-08-20 19:08:53 +0200 | commented answer | How can I generate a Bitset with a fixed capacity and random bits? I agree with you. The alternative is a list of integers. I would expect to be able to use a single integer (interpreted |
2024-08-20 13:36:29 +0200 | answered a question | How can I generate a Bitset with a fixed capacity and random bits? sage: length = 10 sage: Bitset(f"{{:0{length}b}}".format(randint(0, 2**length - 1))) 0010101001 sage: Bitset(f"{{:0{leng |
2024-08-17 22:53:51 +0200 | edited question | windows 10 and sage windows 10 and sage How does one use Sage under Windows 10? |
2024-08-09 09:26:59 +0200 | commented question | Defining several independent Weyl Character Rings It's hard to read but not impossible: in each term the first factor in parentheses is in the base ring G1, and the secon |
2024-08-08 09:57:21 +0200 | received badge | ● Nice Answer (source) |
2024-08-06 20:28:36 +0200 | edited answer | How can I create a proper **dense** PolynomialRing over any ring? The internal representation is dense. You can (efficiently) get the dense list of coefficients as follows: sage: p.coef |
2024-08-06 20:27:06 +0200 | answered a question | How can I create a proper **dense** PolynomialRing over any ring? The internal representation is dense. You can (efficiently) get the dense list of coefficients as follows: sage: p.coef |
2024-08-02 15:50:47 +0200 | commented answer | The sum function doesn't work in my Jupyter notebook. I get the following error message. Any help appreciated. The default value is symbolic_sum, which has a fallback to Python's sum when few arguments are given. See e.g. the outpu |
2024-08-02 15:50:27 +0200 | commented answer | The sum function doesn't work in my Jupyter notebook. I get the following error message. Any help appreciated. The default value is symbolic_sum, which has a fallback to Python's sum when few arguments are given. See e.g. sum?? in |
2024-08-02 15:49:55 +0200 | commented answer | The sum function doesn't work in my Jupyter notebook. I get the following error message. Any help appreciated. @Max The default value is symbolic_sum, which has a fallback to Python's sum when few arguments are given. See e.g. sum? |
2024-08-02 12:06:49 +0200 | commented answer | The sum function doesn't work in my Jupyter notebook. I get the following error message. Any help appreciated. Indeed, one should avoid using names of builtin functions for variables, to avoid losing access to the functions. To get |
2024-07-21 15:59:58 +0200 | received badge | ● Nice Answer (source) |
2024-07-21 15:27:52 +0200 | edited answer | The canonical labels in SageMath are different from those in nauty. Yes they are different, the documentation of canonical_label states that it takes an algorithm parameter, and the defaul |
2024-07-21 15:24:19 +0200 | answered a question | The canonical labels in SageMath are different from those in nauty. Yes they are different, the documentation of canonical_label states that it takes an algorithm parameter, and the defaul |
2024-06-19 12:05:20 +0200 | commented question | Solving polynomial equations using Grobner basis technique What do you want to do if J.dimension() > 0 (i.e. there are not only common points but there is a common curve or sur |
2024-06-19 12:04:39 +0200 | commented question | Solving polynomial equations using Grobner basis technique What do you want to do if J.dimension() > 0 (i.e. there are not only common points but there is a common curve or sur |
2024-06-19 12:03:18 +0200 | commented question | Solving polynomial equations using Grobner basis technique What do you want to do if J.dimension() > 0 (i.e. there are not only common points but there is a common curve or sur |
2024-06-11 12:12:43 +0200 | received badge | ● Nice Answer (source) |
2024-06-05 16:17:05 +0200 | received badge | ● Nice Answer (source) |
2024-06-05 14:05:35 +0200 | commented question | I cannot take sqrt of units Another alternative (after canonicalizing the radical) is to use an ExpressionTreeWalker to substitute numerical approxi |
2024-06-05 13:55:41 +0200 | commented answer | I cannot take sqrt of units I updated the function to determine the variable names automatically. |
2024-06-05 13:54:10 +0200 | edited answer | I cannot take sqrt of units Here is something that works on your second example: def evaluate_with_units(expr): expr_canonical = expr.canonical |
2024-06-05 12:24:53 +0200 | answered a question | I cannot take sqrt of units Here is something that works on your second example: def evaluate_with_units(expr): expr_canonical = expr.canonical |
2024-06-05 12:05:45 +0200 | answered a question | How to add a condition in the sum function in sage Instead of using the symbolic sum that you mention, you can use Python's built-in sum that takes an iterable such as a g |
2024-05-25 10:13:21 +0200 | answered a question | Automated assessment of exercises in Jupyter with Sage I haven't used it myself, but CoCalc has a custom reimplementation of nbgrader: CoCalc Manual / Instructor Guide / Tea |
2024-05-21 14:44:51 +0200 | received badge | ● Good Answer (source) |
2024-05-21 12:52:25 +0200 | received badge | ● Nice Answer (source) |
2024-05-20 23:19:42 +0200 | answered a question | is this a bug? No it is not, in the second instance you wrote b+b instead of b*b, which is not the same thing when b=8. |