| 2026-02-05 20:02:20 +0100 | received badge | ● Nice Answer (source) |
| 2025-10-11 13:03:42 +0100 | answered a question | Obtaining a Lie algebra from a list of matrices At least you can use the interface to GAP: sage: MS = MatrixSpace(QQ, 2) sage: m1 = MS([[0, -1], [1, 0]]) sage: m2 = MS |
| 2025-09-09 10:47:03 +0100 | edited answer | import tetrahedron error Use the source: https://github.com/search?q=repo%3Asagemath%2Fsage%20%22def%20tetrahedron%22&type=code Or within a |
| 2025-09-09 10:44:03 +0100 | answered a question | import tetrahedron error Use the source: https://github.com/search?q=repo%3Asagemath%2Fsage%20%22def%20tetrahedron%22&type=code The function |
| 2025-08-27 11:28:01 +0100 | commented question | docker build implicitly assumes CPU features that I don't have See https://hub.docker.com/r/sagemath/sagemath/#report-bugs-and-issues for possible better channels where to report this |
| 2025-08-24 19:19:07 +0100 | commented question | Trying to install Sage on Mac OS, make stage failed Alright. And for completeness, what's the issue with installing using conda? |
| 2025-08-24 15:06:48 +0100 | commented question | Trying to install Sage on Mac OS, make stage failed Since you don't plan on doing development, you could install a binary release: https://github.com/3-manifolds/Sage_macOS |
| 2025-08-20 10:36:40 +0100 | commented answer | Cannot import name "Category" from virasoro import * works when there is a file named virasoro.py in the same directory (that's how I named my copy of |
| 2025-08-19 20:52:10 +0100 | commented question | How big can be the multiprojective variety for which Macaulay2 can calculate irreducible components and check their smoothness? I don't know, have you tried it? You might want to provide your ideal I if you want a meaningful answer. |
| 2025-08-19 11:58:10 +0100 | commented question | Cannot import name "Category" It seems like a strange thing to make a copy of a file you already have in your SageMath installation. You are talking a |
| 2025-08-14 10:35:11 +0100 | commented question | LLL reduced basis Please add some complete code that actually runs. Do you mean something like this? R.<x> = PolynomialRing(QQ) f = |
| 2025-08-12 19:12:55 +0100 | commented question | Clearing/creating a ring in a loop? I'm not sure yet what the issue is. Could you please post the full error you get in your actual script? (You can edit yo |
| 2025-08-12 11:16:02 +0100 | commented question | Clearing/creating a ring in a loop? It is difficult to help without any specifics. Please add some (more or less minimal) complete runnable code that reprod |
| 2025-08-07 15:43:41 +0100 | answered a question | Knot Theory Gauss Code? In the table at src/sage/knots/knot_table.py, knots are described as closures of braids. The (minimum) braid representat |
| 2025-08-02 12:59:03 +0100 | commented question | polycyclic presentation Please make your code self-contained by adding a definition of gens (any example will do). |
| 2025-07-08 17:27:47 +0100 | received badge | ● Nice Answer (source) |
| 2025-07-05 11:28:31 +0100 | answered a question | Coefficient overflow in PolynomialRing() A workaround (which is probably not efficient) is: sage: A = Zmod(2**256) sage: R.<x,y> = PolynomialRing(A, imple |
| 2025-07-05 11:19:39 +0100 | commented question | How to make these histogram bars symmetric around its value? As far as I can tell this uses matplotlib.pyplot.hist which has the same issue, so you might want to ask the matplotlib |
| 2025-07-05 11:19:31 +0100 | commented question | How to make these histogram bars symmetric around its value? As far as I can tell this uses matplotlib.pyplot.hist which has the same issue, so you might want to ask the matplotlib |
| 2025-07-05 09:05:33 +0100 | answered a question | How do I declare a static finite field Element when modulus is a prime power ? Simple answer: Once you have z12 assigned to a variable you can use it directly: sage: X = 162606730613419492752575632 |
| 2025-07-01 22:12:50 +0100 | commented answer | How to evaluate composed rational maps over finite fields? Yes, you can do e.g. list(h) or tuple(h); I added it to my answer. |
| 2025-07-01 22:11:55 +0100 | edited answer | How to evaluate composed rational maps over finite fields? Here is a way: F = GF(23) A2.<x,y> = AffineSpace(F, 2) H = Hom(A2, A2) h0 = H([(x^2 + 1)/x, (x^2*y - y)/x^2]) h1 |
| 2025-07-01 14:22:31 +0100 | commented question | Groebner basis computation extremely slow Could you please add the equivalent Macaulay2 code that works faster? |
| 2025-06-30 00:00:44 +0100 | answered a question | How to evaluate composed rational maps over finite fields? Here is a way: F = GF(23) A2.<x,y> = AffineSpace(F, 2) H = Hom(A2, A2) h0 = H([(x^2 + 1)/x, (x^2*y - y)/x^2]) h1 |
| 2025-06-13 17:39:49 +0100 | received badge | ● Good Answer (source) |
| 2025-06-13 03:19:36 +0100 | received badge | ● Nice Answer (source) |
| 2025-06-12 20:14:15 +0100 | answered a question | Multivariate polynomial cannot be evaluated at vector despite length being correct Sage is not smart enough to understand what you want. In the source code we can see it does handle lists and tuples as |
| 2025-05-27 11:58:03 +0100 | received badge | ● Nice Answer (source) |
| 2025-05-27 01:38:43 +0100 | received badge | ● Guru (source) |
| 2025-05-27 01:38:43 +0100 | received badge | ● Great Answer (source) |
| 2025-05-21 08:40:11 +0100 | commented question | Is multiplication cached? You might also do some computations in the polynomial ring and use a pre-computed Gröbner basis G = I.groebner_basis() t |
| 2025-04-06 14:12:44 +0100 | 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 +0100 | received badge | ● Nice Answer (source) |
| 2025-01-26 09:57:04 +0100 | 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 +0100 | 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 +0100 | 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 +0100 | 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 +0100 | 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 +0100 | 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 +0100 | 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 +0100 | received badge | ● Good Answer (source) |
| 2024-11-06 00:04:57 +0100 | received badge | ● Nice Answer (source) |
| 2024-11-04 21:58:35 +0100 | 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 +0100 | received badge | ● Nice Answer (source) |
| 2024-10-31 08:52:17 +0100 | 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 +0100 | 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 +0100 | 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 +0100 | 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 +0100 | 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 +0100 | 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 |
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.