2024-01-28 09:36:24 +0100 | received badge | ● Famous Question (source) |
2023-10-11 19:11:51 +0100 | received badge | ● Notable Question (source) |
2023-10-11 19:11:51 +0100 | received badge | ● Famous Question (source) |
2023-07-30 13:17:14 +0100 | received badge | ● Popular Question (source) |
2023-07-20 14:39:39 +0100 | received badge | ● Famous Question (source) |
2023-05-27 19:38:55 +0100 | received badge | ● Popular Question (source) |
2023-05-27 19:38:55 +0100 | received badge | ● Notable Question (source) |
2022-12-21 16:25:10 +0100 | received badge | ● Famous Question (source) |
2022-10-19 20:09:07 +0100 | marked best answer | Rewriting linear combination of Groebner basis in terms of original terms Let assume I have an ideal given by where f1,f2,f3 are just polynomials in variables x,y,z. Let's say B=(g1,g2). Let's assume I happen to take a polynomial,h, that is in my ideal I. Then doing polynomial division, I can write Basically I can write h as a linear combination of the elements in my Groebner basis. Is there a function that converts a linear combination in terms of Groebner to linear combination of terms in my ideal I? i.e.I can write |
2022-09-28 01:49:05 +0100 | received badge | ● Famous Question (source) |
2022-09-04 11:47:43 +0100 | received badge | ● Notable Question (source) |
2022-09-04 11:47:43 +0100 | received badge | ● Popular Question (source) |
2022-06-05 15:03:28 +0100 | received badge | ● Notable Question (source) |
2022-05-19 15:33:51 +0100 | received badge | ● Popular Question (source) |
2022-04-06 08:25:40 +0100 | received badge | ● Nice Question (source) |
2022-04-06 05:57:25 +0100 | edited question | Determining whether module is free for polynomial/power series rings Determining whether module is free for polynomial/power series rings Say I have two modules R = QQ[[x, y, z]] S = QQ[[x |
2022-04-04 18:24:23 +0100 | commented question | Determining whether module is free for polynomial/power series rings Hello, I just made that as an example. So to make thing simpler, let's ignore the +1. If we think of polynomial ring fir |
2022-04-04 18:23:17 +0100 | commented question | Determining whether module is free for polynomial/power series rings Hello, I just made that as an example. So to make thing simpler, let's ignore the +1. If we think of polynomial ring fir |
2022-04-02 06:50:20 +0100 | asked a question | Determining whether module is free for polynomial/power series rings Determining whether module is free for polynomial/power series rings Hello, I am wondering if I have say two modules R=Q |
2022-02-07 18:47:41 +0100 | received badge | ● Famous Question (source) |
2021-12-07 02:13:18 +0100 | asked a question | What does the e in the output mean? What does the e in the output mean? Hello, what does the e in the output mean? What number is -1.36424205265939e-12? See |
2021-10-20 18:29:47 +0100 | commented question | Indenting in Cocalc vs Sage Notebook Okay cool thanks. |
2021-10-20 14:03:25 +0100 | asked a question | Indenting in Cocalc vs Sage Notebook Indenting in Cocalc vs Sage Notebook Hello I started using Cocalc. I had a Sage Notebook installed on my computer. On my |
2021-10-20 11:48:09 +0100 | received badge | ● Nice Question (source) |
2021-10-20 11:22:39 +0100 | received badge | ● Notable Question (source) |
2021-09-09 14:00:33 +0100 | received badge | ● Popular Question (source) |
2021-07-31 17:00:20 +0100 | marked best answer | Solutions to Equations over different fields Hello, suppose I want to solve a system of equations This gives me solutions over complex numbers I believe? How can I ask for solutions over say a finite field. Let's make it more simple and say the field is a prime and not a prime power. Hence, just reducing modulo p. As you all know, it is possible more solutions arise when moving to finite fields. |
2021-07-31 10:48:11 +0100 | received badge | ● Popular Question (source) |
2021-07-30 17:50:25 +0100 | commented answer | Solutions to Equations over different fields Hello take p=5, what would it mean if the dimension of variety is still one after adding in the Frobenius equations? For |
2021-07-30 17:48:28 +0100 | commented answer | Solutions to Equations over different fields Hello, what would it mean if the dimension of variety is still one after adding in the Frobenius equations? For example, |
2021-07-29 06:30:15 +0100 | asked a question | Solutions to Equations over different fields Solutions to Equations over different fields Hello, suppose I want to solve a system of equations w,x,y,z = SR.var('w, |
2021-07-07 05:36:56 +0100 | received badge | ● Popular Question (source) |
2021-06-04 10:15:00 +0100 | received badge | ● Notable Question (source) |
2021-06-03 07:32:08 +0100 | commented answer | Multivariate Polynomial Ring +1 variable Great thanks. |
2021-06-03 07:31:58 +0100 | commented answer | Multivariate Polynomial Ring +1 variable Great thanks. |
2021-06-03 07:31:50 +0100 | marked best answer | Multivariate Polynomial Ring +1 variable So the idea is I was first working over I have a function f and J is the Jacobian of f belonging to the ring above. I do some stuff and I end with a polynomial g in a symbolic ring in variables w,x,z. I want to lift g. So I want to do Now, the Symbolic ring has no attribute lift. This can be fixed by moving to Multivariate Polynomiial Ring by doing The issue is, because g is only a function in w,x,z, this moves g to the Multivariate Polynomial Ring of w,x,z. This gives error as the Jacobian and function f is in Multivariate Polynomial Ring of w,x,y,z. I want g to be in the Multivariate Polynomial Ring of w,x,y,z even though there is no y in g. How can I do this? See my 2 attachment. In the attachment, h2 plays the role of g in my explanation above. C:\fakepath\Screenshot (126).pngC:\fakepath\Screenshot (123).png |
2021-06-02 22:26:07 +0100 | edited question | Multivariate Polynomial Ring +1 variable Multivariate Polynomial Ring +1 variable So the idea is I was first working over R.<w,x,y,z>=QQ[] I have a fun |
2021-06-02 22:25:51 +0100 | edited question | Multivariate Polynomial Ring +1 variable Multivariate Polynomial Ring +1 variable So the idea is I was first working over R.<w,x,y,z>=QQ[] I have a fun |
2021-06-02 22:25:02 +0100 | edited question | Multivariate Polynomial Ring +1 variable Multivariate Polynomial Ring +1 variable So the idea is I was first working over R.<w,x,y,z>=QQ[] I have a fun |
2021-06-02 22:23:39 +0100 | asked a question | Multivariate Polynomial Ring +1 variable Multivariate Polynomial Ring +1 variable So the idea is I was first working over R.<w,x,y,z>=QQ[] I have a fun |
2021-05-13 20:58:44 +0100 | received badge | ● Nice Question (source) |
2021-05-13 02:54:44 +0100 | asked a question | Singularity Type Singularity Type Hello, so in Singular, there is a way to give an affine equation and determine the singularity type. Fo |
2021-05-11 03:48:34 +0100 | commented answer | Determinant Function on Qp Great thanks. |
2021-05-11 03:48:24 +0100 | marked best answer | Determinant Function on Qp See attachmentC:\fakepath\Screenshot (104).png I basically have 2 matrices with entries in Qp. I cant exactly do Matrix2.charpoly() as this is det (xI-Matrix2) and I want determinant of (I-xMatrix2). So I decided to just type det(I-x*Matrix2) but it gives me error. Is there a way to fix this? If you want me to be honest, I get an error just from I-x*Matrix2. So it might not even be the determinant function. |
2021-05-10 23:25:41 +0100 | commented answer | Determinant Function on Qp Great thanks. I have a question on this. Suppose I have a matrix with rational entries. So let's say Matrix is = [a, b] |