2022-02-28 08:29:39 +0200 | commented question | Incorrect result for complex integral See also https://trac.sagemath.org/ticket/17183. |
2022-02-26 12:07:35 +0200 | received badge | ● Nice Answer (source) |
2022-02-22 21:39:19 +0200 | edited answer | factorization and multiplication in polynomial ring It might be better to do this computation in the symbolic ring instead in order to avoid expansions, i.e. # from the qu |
2022-02-22 21:38:52 +0200 | edited answer | factorization and multiplication in polynomial ring It might be better to do this computation in the symbolic ring instead in order to avoid expansions, i.e. # from the qu |
2022-02-22 21:38:20 +0200 | answered a question | factorization and multiplication in polynomial ring It might be better to do this computation in the symbolic ring instead in order to avoid expansions, i.e. # from the qu |
2022-02-18 23:50:19 +0200 | commented question | Polynomial division on non usual ring. Maybe you could use QQbar instead of UCF? |
2022-02-18 23:45:20 +0200 | commented question | Use different ipython profile I think Sage does not use the main IPython profile from ~/.ipython, but has its own copy in ~/.sage/ipython-5.0.0. |
2022-02-18 23:30:02 +0200 | answered a question | many integrals cause giac crash but work inside giac This looks like a bug in giac. The integrand that Sage passes to giac is (b^2*x^2 + a*b*x*2 + a^2)^(-3/2) * x^4 which |
2022-02-14 21:03:25 +0200 | received badge | ● Nice Answer (source) |
2022-02-14 08:32:36 +0200 | answered a question | Why specifying `stylesheet` parameter in plot function causes error? To answer your second question, you can put this in your init.sage file: import matplotlib.style matplotlib.style.use(" |
2022-02-11 19:55:33 +0200 | commented question | Using Seaborn Graphing in Sagemath As Sage seems to overwrite part of the style, I find it easier to create the plots directly in matplotlib, especially fo |
2022-02-11 19:09:22 +0200 | commented answer | Exporting from Sage to Macaulay2 IMO, it would be better to correct the existing answer which has already been accepted. Otherwise it might encourage sim |
2022-02-11 11:20:28 +0200 | received badge | ● Nice Answer (source) |
2022-02-11 08:18:28 +0200 | commented answer | Exporting from Sage to Macaulay2 No! This answer is not the right thing to do. It fails in all but the most basic examples because it relies on Macaulay2 |
2022-02-10 23:03:21 +0200 | received badge | ● Necromancer (source) |
2022-02-10 22:57:49 +0200 | answered a question | Sinc function This may not be perfect yet, but seems to work. This uses NumPy for numeric evaluation and SymPy for symbolic evaluation |
2021-07-20 21:15:32 +0200 | commented answer | Solving equations in SageMath Usually, you need a second equation to solve for two variables. |
2021-07-20 21:04:47 +0200 | commented question | polynomial multiplication is unexpectedly slow S is a nested polynomial ring, for which multiplication is very slow in Sage. It uses the Karatsuba algorithm, which I t |
2021-07-16 21:12:49 +0200 | commented question | _invert_ for ring which is not integral The __invert__ method needs to be defined with double underscores instead of single underscores. If you implement it, th |
2021-07-15 20:46:51 +0200 | commented answer | numeric precision unexpectedly low Great. This answer has just helped me a lot with a complex integral I could not solve before. |
2021-07-14 20:03:51 +0200 | answered a question | Problem with precompute and append in parallel computing Presumably, you want to make available the partially computed results to speed up computations in the body of the functi |
2021-07-14 09:33:25 +0200 | commented answer | Polynomial system without solution in char. 0: classification of char. p with solution Nice. How long did the factorization take? This means the full list of primes for which the system A1+A2+extra has a Grö |
2021-07-14 09:32:10 +0200 | commented answer | Polynomial system without solution in char. 0: classification of char. p with solution Nice. How long did the factorization take? This means the full list of primes for which the system A1+A2+extra has a Grö |
2021-07-13 12:32:41 +0200 | received badge | ● Good Answer (source) |
2021-07-12 19:43:28 +0200 | commented answer | Polynomial system without solution in char. 0: classification of char. p with solution On a second machine, with Sage installed from pacman, the computation takes only 2 minutes 40 seconds. |
2021-07-12 19:36:34 +0200 | commented answer | Polynomial system without solution in char. 0: classification of char. p with solution Yes. I reran the computation and it finished in about 6 minutes. Try to run each command of the function individually. T |
2021-07-10 18:16:02 +0200 | edited answer | Polynomial system without solution in char. 0: classification of char. p with solution To lift C1 in terms of A1, we can use Singular's liftstd function to compute a Gröbner basis (standard basis) and the li |
2021-07-10 18:15:51 +0200 | edited answer | Polynomial system without solution in char. 0: classification of char. p with solution To lift C1 in terms of A1, we can use Singular's liftstd function to compute a Gröbner basis (standard basis) and the li |
2021-07-10 16:51:25 +0200 | received badge | ● Nice Answer (source) |
2021-07-10 14:07:06 +0200 | answered a question | Polynomial system without solution in char. 0: classification of char. p with solution To lift C1 in terms of A1, we can use Singular's liftstd function to compute a Gröbner basis (standard basis) and the li |
2021-07-02 20:43:14 +0200 | commented answer | Quick (trivial) Groebner basis but too long lift of one @Sébastien Palcoux Instead of writing 1 as a linear combination of the generators of C, you would want to write each gen |
2021-07-02 20:42:44 +0200 | commented answer | Quick (trivial) Groebner basis but too long lift of one @Sébastien Palcoux Instead of writing 1 as a linear combination of the generators of C, you would want to write each gen |
2021-06-04 21:35:36 +0200 | answered a question | why giac integrate result fail to be parsed when using letter e? Sage is not able to understand the output of Giac because the result returned by Giac contains the expression sqrt(-exp( |
2021-06-04 19:16:21 +0200 | commented answer | why giac integrate result fail to be parsed when using letter e? See also https://trac.sagemath.org/ticket/30133. |
2021-06-04 19:14:07 +0200 | commented answer | why using giac via libgiac crashes sagemath when giac crashes? Even if Giac crashes and Sage does not, it is safer to restart Sage as well, just to be sure that no unclean internal st |
2021-06-04 19:12:08 +0200 | commented question | division by zero from integrate to giac. Where does long giac output come from? Indeed, I get the same error with libgiac now. I am not sure what I have done differently before. Though, if I replace e |
2021-06-03 18:38:59 +0200 | received badge | ● Good Answer (source) |
2021-06-03 09:42:21 +0200 | received badge | ● Nice Answer (source) |
2021-06-01 09:15:09 +0200 | received badge | ● Good Answer (source) |
2021-06-01 09:14:41 +0200 | received badge | ● Nice Answer (source) |
2021-06-01 02:18:33 +0200 | received badge | ● Nice Answer (source) |
2021-05-31 21:55:34 +0200 | commented question | division by zero from integrate to giac. Where does long giac output come from? I cannot answer your main question, but have a few remarks. First, this works fine with libgiac. Secondly, there is a pr |
2021-05-31 21:36:18 +0200 | commented answer | why using giac via libgiac crashes sagemath when giac crashes? This bug is now tracked at https://trac.sagemath.org/ticket/31887. |
2021-05-31 21:21:57 +0200 | edited answer | Finding centraliser algebras of a finite set of matrices If your matrices have exact entries (for example in ℚ or a finite field), you can consider the polynomial ring $R = K[x_ |
2021-05-31 20:59:56 +0200 | answered a question | Finding centraliser algebras of a finite set of matrices If your matrices have exact entries (for example in ℚ or a finite field), you can consider the polynomial ring $R = K[x_ |
2021-05-31 20:31:16 +0200 | answered a question | why using giac via libgiac crashes sagemath when giac crashes? Yes, this looks like a bug and your explanation of the problem seems correct. It is not possible to recover from a crash |
2021-05-29 16:26:47 +0200 | received badge | ● Nice Answer (source) |
2021-05-28 22:42:35 +0200 | edited answer | result that comes with warning from giac integrator These issues with the text-based interfaces are known. See for example #28913 for a very similar problem. Instead of th |
2021-05-28 19:58:19 +0200 | answered a question | "f not in I" and singular errors during "lift" of a polynomial, but "f in I" returns True The algorithms behind ideal membership testing cannot work reliably over inexact fields such as CC. For a simple example |
2021-05-28 19:51:12 +0200 | answered a question | result that comes with warning from giac integrator These issues with the text-based interfaces are known. See for example #28913 for a very similar problem. Instead of th |