2023-11-24 15:30:45 +0100 | received badge | ● Good Answer (source) |

2023-11-24 13:25:15 +0100 | received badge | ● Nice Answer (source) |

2023-11-24 13:12:53 +0100 | edited answer | How to divide two polynomials in GF(2)[x] and get result in same type as of operands Like this: sage: R.<x> = PolynomialRing(GF(2)) sage: f = x^3 - 1 sage: g = x - 1 sage: f // g x^2 + x + 1 sage: t |

2023-11-24 13:12:30 +0100 | edited answer | How to divide two polynomials in GF(2)[x] and get result in same type as of operands sage: R.<x> = PolynomialRing(GF(2)) sage: f = x^3 - 1 sage: g = x - 1 sage: f // g x^2 + x + 1 |

2023-11-24 13:11:16 +0100 | answered a question | How to divide two polynomials in GF(2)[x] and get result in same type as of operands sage: R.<x> = PolynomialRing(GF(2)) sage: f = x^3 - 1 sage: g = x - 1 sage: f // g x^2 + x + 1 sage: type(f // g) |

2023-11-14 11:22:25 +0100 | answered a question | check if coefficients of a polynomial are divisible by a number You can do it like this: sage: R.<x> = PolynomialRing(ZZ) sage: n = 3 sage: f = x^3 + 1 sage: all(n.divides(c) fo |

2023-11-11 08:41:47 +0100 | received badge | ● Nice Answer (source) |

2023-11-10 21:02:22 +0100 | answered a question | Cannot index an array - causing key error , context astropy.io You can do hdul[int(0)] to work around Sage's Integer wrapper for literal integers. |

2023-11-07 15:13:04 +0100 | commented question | Large System of Quadratic Trigonometric Equations Indeed SageMathCell has a time limit for computations. That print statement is not executed because J1.dimension() is a |

2023-11-05 16:53:27 +0100 | answered a question | Simplifying a polynomial expression Yes, this is just a factorization: sage: var('μ,ν') sage: (μ^8+4*μ^6*ν^2+6*μ^4*ν^4+4*μ^2*ν^6+ν^8).factor() (μ^2 + ν^2)^ |

2023-10-08 12:08:29 +0100 | answered a question | How can I obtain representatives of a quotient ring? Go this way instead: sage: P = K.ideal(p) sage: R = P.residue_field() sage: R.cardinality() 13 sage: [z.lift() for z in |

2023-10-04 16:14:11 +0100 | edited answer | Typo in operationtable In fact the colors are correct but the labels are wrong. I've submitted a pull request to fix it here: Fix element la |

2023-10-04 16:12:48 +0100 | answered a question | Typo in operationtable In fact the colors are correct but the labels are wrong. I've submitted a pull request to fix it here: Fix element lab |

2023-10-04 13:31:26 +0100 | answered a question | Does Codenode have compatibility with Sage? I suppose you mean https://github.com/0xf0f/codenode Running sage -pip install 0xf0f-codenode works without issue on my |

2023-10-04 13:14:27 +0100 | answered a question | Column space of a matrix Sage displays all vector spaces with the basis given in rows of a matrix; see the documentation of basis_matrix. The ba |

2023-10-04 11:11:35 +0100 | answered a question | Column space of a matrix What you expected should be read sideways, and then it's just a different basis of the same column space: sage: A = mat |

2023-09-27 11:49:41 +0100 | answered a question | assume() not playing well with solve_diophantine() The explanation is that solve_diophantine simply calls sympy's diophantine, which ignores all assumptions. So you will |

2023-09-13 13:49:09 +0100 | commented answer | import astropy in a sage notebook v De rien! That is a valid use case for old SageMath versions of course. There are instructions for conversion of .sws to |

2023-09-13 11:02:38 +0100 | commented answer | import astropy in a sage notebook v De rien! That's is a valid use case for old SageMath versions of course. There are instructions for conversion of .sws t |

2023-09-13 11:02:13 +0100 | commented answer | import astropy in a sage notebook v De rien! That's is a valid use case for old SageMath versions of course. There are instructions for conversion of .sws t |

2023-09-12 21:19:43 +0100 | commented question | import astropy in a sage notebook v Any particular reason you're using a version of Sage that's over four years old? Try sage -pip install astropy to instal |

2023-09-12 21:08:54 +0100 | commented question | import astropy in a sage notebook v Any particular reason you're using a version of Sage that's over four years old? Try sage -pip install astropy to instal |

2023-09-06 18:17:10 +0100 | commented question | Free algebra identity (empty word) and involution It's A.one() like it is for most objects with a unit, but that doesn't seem to solve the problem. |

2023-08-31 21:26:52 +0100 | commented question | Checking whether a Dynkin graph is invariant under the canonical automorphism With that definition DiGraph([(2, 3), (3, 0), (1, 0)]) would be stable (contrary to your example), is that right? |

2023-08-31 20:42:01 +0100 | commented question | Checking whether a Dynkin graph is invariant under the canonical automorphism What is the precise definition of stable in this case? To me DiGraph([(1, 3), (3, 2), (2, 0)]) does not look stable unde |

2023-08-30 17:53:15 +0100 | commented question | checking if element of QQbar is in QQ How is the initial element in QQbar constructed? Since you have hundreds of thousands of them, you might add at least on |

2023-08-30 17:52:17 +0100 | commented question | checking if element of QQbar is in QQ How is the initial element in QQbar constructed? Since you have hundreds of thousands of them, you might add at least on |

2023-08-18 20:19:17 +0100 | received badge | ● Nice Answer (source) |

2023-08-18 08:55:30 +0100 | edited answer | Problems with memory usage with bliss algorithm Which version of SageMath are you using? I remember investigating this over a year ago and the issue #33010 should be fi |

2023-08-18 08:48:01 +0100 | answered a question | Problems with memory usage with bliss algorithm Which version of SageMath are you using? I remember investigating this over a year ago and it should be fixed by #33010 |

2023-08-15 09:36:28 +0100 | commented question | Symbolic expressions in positive characteristic What is the end goal here? This sounds like an XY problem. You might use an ExpressionTreeWalker to solve this problem Y |

2023-08-11 17:47:37 +0100 | commented question | notation appointment I think the syntax is inspired by Magma. |

2023-08-11 14:10:59 +0100 | received badge | ● Nice Answer (source) |

2023-08-11 06:40:41 +0100 | answered a question | Using vector with variables over a finite field Instead of symbolic variables you can use the generators of a polynomial ring: sage: R.<x,y,z> = PolynomialRing(G |

2023-08-03 12:05:59 +0100 | received badge | ● Nice Answer (source) |

2023-08-02 16:12:22 +0100 | answered a question | Displaying a matrix with scalar fields sage: mymatrix.apply_map(lambda z: z.expr()) [f(t, r, th, ph) + g(t, r, th, ph) g(t, r, th, ph) |

2023-07-31 18:05:19 +0100 | received badge | ● Good Answer (source) |

2023-07-30 20:31:07 +0100 | commented answer | Trouble transforming a groebner basis You're welcome! Indeed it wouldn't make a difference in performance, it would just be cleaner than using the pexpect int |

2023-07-30 14:05:36 +0100 | answered a question | Trouble transforming a groebner basis You can use Singular's notion of a ring with parameters, but Sage's PolynomialRing interface to Singular doesn't underst |

2023-07-29 11:07:48 +0100 | commented question | How to reproduce `elimination_ideal` with Giac ? Cross-posted to MathOverflow: Gröbner implicitization with relationships between the variables. |

2023-07-29 10:18:30 +0100 | received badge | ● Nice Answer (source) |

2023-07-29 08:40:13 +0100 | edited answer | sol = solve([x^2+y^2+z^2==2, x^3+y^3+z^3==2,x^4+y^4+z^4==2], x,y,z) The solutions can all be expressed in terms of radicals: R.<x,y,z> = QQ[] I = R.ideal([x^2+y^2+z^2-2, x^3+y^3+z^3 |

2023-07-29 08:36:28 +0100 | commented question | sol = solve([x^2+y^2+z^2==2, x^3+y^3+z^3==2,x^4+y^4+z^4==2], x,y,z) The solutions can all be expressed in terms of radicals. |

2023-07-24 22:16:33 +0100 | commented question | How to color area between 2+ functions Do you want to do this just for linear functions? In that case I would just determine the intersection points and draw t |

2023-07-24 19:39:15 +0100 | answered a question | How to reproduce `elimination_ideal` with Giac ? You should specify not only an ordering of variables but a monomial ordering or term ordering. An algorithm for the elim |

2023-07-22 20:12:03 +0100 | received badge | ● Good Answer (source) |

2023-07-22 15:46:23 +0100 | received badge | ● Nice Answer (source) |

2023-07-22 13:57:11 +0100 | edited answer | Trigonometric System of Quadratic Equations Here is a different approach, not necessarily optimal but working: R.<c1, c2, x, y, cos_beta, sin_beta, r> = Poly |

2023-07-22 12:01:46 +0100 | answered a question | Trigonometric System of Quadratic Equations Here is a different approach, not necessarily optimal but working: R.<c1, c2, x, y, cos_beta, sin_beta, r> = Poly |

2023-07-19 14:03:00 +0100 | commented question | Finding and Identifying Finite Subgroups in SageMath Please add minimal working code to define your finite matrix group. |

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.