2023-03-15 09:59:26 +0200 | answered a question | solving 2 non-linear functions (max degree of 3) fails var('k x') r=0.2 c=0.7 fp1=k*x^3 dfp1=diff(fp1,x) fp2=sqrt(expand(r^2-(x-c)^2)) dfp2 = diff(fp2, x) fp3 = expand(-k*(x-1 |

2023-03-12 17:55:40 +0200 | edited answer | Regarding remove() function In your code W defines the range of the loop but changes inside. It can be improved as follows: T=Tuples((0,1),4) W=[m |

2023-03-11 19:29:57 +0200 | edited answer | Regarding remove() function In your code W defines the range of the loop but changes inside. It can be improved as follows: T=Tuples((0,1),4) W=[m |

2023-03-11 16:08:36 +0200 | answered a question | Regarding remove() function In yor code W defines the range of the loop but changes inside. It can be improved as follows: T=Tuples((0,1),4) W=[ma |

2023-03-11 09:10:33 +0200 | commented question | How to solve differential equation series solution My advice is to search for: solve_linear_de in https://doc.sagemath.org/html/en/reference/power_series/sage/rings/power |

2023-03-10 17:39:02 +0200 | commented question | How to solve differential equation series solution My advice is to search for: solve_linear_de in https://doc.sagemath.org/html/en/reference/power_series/sage/rings/power |

2023-03-10 17:37:45 +0200 | commented question | How to solve differential equation series solution My advice is to search for: solve_linear_de in https://doc.sagemath.org/html/en/reference/power_series/sage/rings/power |

2023-03-08 23:22:02 +0200 | commented question | New ways to install Sage failed ; Need help See also https://ask.sagemath.org/question/66159/best-and-easy-way-to-install-sagemath-in-w11/ |

2023-03-05 15:23:20 +0200 | commented question | efficient generation of restricted divisors Not all divisors, all divisors from output. This is a significant difference for me. Nice to see some similarities. I ho |

2023-03-05 14:51:09 +0200 | commented question | efficient generation of restricted divisors Not all divisors, all divisors from output. This is a significant difference for me. Nice to see some similarities. |

2023-03-05 11:00:58 +0200 | commented question | problem with constant_coefficient of a form of ExteriorAlgebra The same variable e2 appears 2 times |

2023-03-05 07:56:35 +0200 | commented question | efficient generation of restricted divisors Maybe this is relevant? def divisors0(f,B): output=[1] for p, e in f: prev = output[:] |

2023-03-05 06:49:38 +0200 | edited answer | Applying a bivariate function to a list of couples If all 16 values are expected, then you can do also: def F(x): v=x[0];a=x[1] if v > a : r |

2023-03-04 21:48:32 +0200 | received badge | ● Nice Answer (source) |

2023-03-04 14:47:46 +0200 | answered a question | Applying a bivariate function to a list of couples If all 16 values are expected, then you can do also: def F(x): a=x[0];v=x[1] if v > a : r |

2023-03-04 08:03:07 +0200 | edited answer | Is there a function for negacyclic matrices? One can define: ( r denotes the first row) def negacyclic(r): a=reversed(list(r[1:])) c=[r[0]]+list(-vector(a) |

2023-03-04 08:01:43 +0200 | answered a question | Is there a function for negacyclic matrices? One can define: ( r denotes the first row) def negacyclic(r): a=list(reversed(list(r[1:]))) c=[r[0]]+list(-vec |

2023-03-02 18:34:35 +0200 | commented question | Trying to install sagemath crashes computer Ubuntu 22.04 In https://ask.sagemath.org/question/66159/best-and-easy-way-to-install-sagemath-in-w11/ a successful instalation in WS |

2023-03-02 18:27:09 +0200 | commented question | Trying to install sagemath crashes computer Ubuntu 22.04 In https://ask.sagemath.org/question/66159/best-and-easy-way-to-install-sagemath-in-w11/ a successful instalation in WS |

2023-03-02 18:23:24 +0200 | commented question | Trying to install sagemath crashes computer Ubuntu 22.04 In https://ask.sagemath.org/question/66159/best-and-easy-way-to-install-sagemath-in-w11/ a successful instalation in WS |

2023-03-02 18:01:51 +0200 | commented question | Trying to install sagemath crashes computer Ubuntu 22.04 |

2023-03-02 18:01:29 +0200 | commented question | Trying to install sagemath crashes computer Ubuntu 22.04 In https://ask.sagemath.org/question/66159/best-and-easy-way-to-install-sagemath-in-w11/ asuccessful instalation in WSL |

2023-02-26 08:29:29 +0200 | commented question | Computing singular locus Do you mean R=PolynomialRing(SR,'x',5) x=R.gens() a=var('a',n=5) p=a0*x[0]^2+a2*x[2]^3 J=p.jacobian_ideal();J Note ho |

2023-02-26 08:24:15 +0200 | commented question | Computing singular locus This version works without warnings R = PolynomialRing(QQ,'a',5) F = R.fraction_field() P = PolynomialRing(F,'x',5) a = |

2023-02-25 14:23:44 +0200 | commented question | Computing singular locus This version works without warnings R.<c1,c2> = PolynomialRing(QQ) F = R.fraction_field() S.<x,y,z> = Polyn |

2023-02-25 11:35:56 +0200 | commented question | Computing singular locus You can always check codes on Sagecell Server (google sagecell). The slownes can be real obstacle. I think that in the |

2023-02-25 11:29:30 +0200 | commented question | Computing singular locus You can always check code on Sagecell Server (google sagecell). The slownes can be real obstacle. I think that in the b |

2023-02-25 11:20:42 +0200 | commented question | Computing singular locus You can always check code on Sagecell Server (google sagecell). The slownes can be real obstacle. I think that in the b |

2023-02-25 11:15:30 +0200 | commented question | Computing singular locus You can always check code on Sagecell Server (google sagecell). The slownes can be real obstacle. I think that in the b |

2023-02-25 11:09:16 +0200 | commented question | Computing singular locus You can always check code on Sagecell Server (google sagecell) |

2023-02-24 19:44:51 +0200 | commented question | Computing singular locus Do you mean R=PolynomialRing(SR,'x',5) x=R.gens() a=var('a',n=5) p=a0*x[0]^2+a2*x[2]^3 J=p.jacobian_ideal();J Note ho |

2023-02-24 19:41:57 +0200 | commented question | Computing singular locus Do you mean R=PolynomialRing(SR,'x',5) x=R.gens() a=var('a',n=5) p=a0*x[0]^2+a2*x[2]^3 J=p.jacobian_ideal();J |

2023-02-24 19:33:42 +0200 | commented question | Computing singular locus Do you mean R=PolynomialRing(SR,'x',5) x=R.gens() a=var('a',n=5) p=a0*x[0]^2+a2*x[2]^3 p.jacobian_ideal() |

2023-02-24 19:26:28 +0200 | commented question | Computing singular locus Do you mean lx=[f'x{i}' for i in range(5)] R=PolynomialRing(SR,lx) x=R.gens() a=var('a',n=N) p=a0*x[0]^2+a2*x[2]^3 p.ja |

2023-02-24 19:22:22 +0200 | commented question | Computing singular locus Do you mean R=PolynomialRing(SR,lx) x=R.gens() a=var('a',n=N) p=a0*x[0]^2+a2*x[2]^3 p.jacobian_ideal() |

2023-02-24 17:39:44 +0200 | commented question | Computing singular locus In https://www.singular.uni-kl.de/ftp/pub/Math/Singular/src/4-1-1/singular.pdf there are some examples of investigating |

2023-02-24 16:45:59 +0200 | commented question | Computing singular locus In https://faculty.math.illinois.edu/Macaulay2/Book/ComputationsBook/book/book.pdf one can find some examples of fin |

2023-02-24 16:37:16 +0200 | commented question | Computing singular locus In https://faculty.math.illinois.edu/Macaulay2/Book/ComputationsBook/book/book.pdf one can find some examples of fin |

2023-02-24 16:31:33 +0200 | commented question | Computing singular locus In https://faculty.math.illinois.edu/Macaulay2/Book/ComputationsBook/book/book.pdf one can find some examples of fin |

2023-02-24 14:11:54 +0200 | commented answer | On mutating a variable to a function I reedited my answer |

2023-02-24 14:10:49 +0200 | edited answer | On mutating a variable to a function This is not a short way but without rhs: var('x y p_x p_y R λ') U(x,y)= x*y L(x,y,λ)= U(x,y)+λ*(R-p_x*x-p_y*y) sol = so |

2023-02-24 12:19:19 +0200 | answered a question | On mutating a variable to a function This is not a short way but without rhs: var('x y p_x p_y R λ') U(x,y)= x*y L(x,y,λ)= U(x,y)+λ*(R-p_x*x-p_y*y) sol = so |

2023-02-24 10:17:41 +0200 | commented question | Displaying a smaller number of 0 for a Real call Check: 0.25==n(0.25,10) True but such cosmetics can be safe only for presentation, not in calculations (where more bi |

2023-02-24 09:20:49 +0200 | commented question | Displaying a smaller number of 0 for a Real call Check: 0.25==n(0.25,10) True but such cosmetics can be safe only for presentation, not in calculations (where more bi |

2023-02-24 09:10:27 +0200 | commented question | Displaying a smaller number of 0 for a Real call Check: 0.25==n(0.25,10) True but such cosmetics can be safe only for presentation, not in calculations (where more bi |

2023-02-24 09:08:32 +0200 | commented question | Displaying a smaller number of 0 for a Real call |

2023-02-24 08:45:14 +0200 | commented question | Displaying a smaller number of 0 for a Real call |

2023-02-24 08:34:47 +0200 | commented question | Displaying a smaller number of 0 for a Real call |

2023-02-24 01:19:44 +0200 | commented question | Displaying a smaller number of 0 for a Real call Check: 0.25==n(0.25,10) True n(n(0.25),53) 0.250000000000000 but such cosmetics can be safe only for presentation, n |

2023-02-24 01:11:29 +0200 | commented question | Displaying a smaller number of 0 for a Real call Check: 0.25==n(0.25,10) True n(n(0.25),53) 0.250000000000000 but such cosmetics can be safe only for presentation, n |

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.