[sage-support] Re: Jupyter kernels for R, gp, gap, etc

2020-08-05 Thread Tim McLarnan
OK, the last mess was my error. I had multiple versions of R installed, one by conda and an older global R. Naturally this caused problems. Getting rid of the older R solved the problem. Everything is now good. Thanks, all! This whole process is still a bit daunting for us amateurs. I

[sage-support] Re: Jupyter kernels for R, gp, gap, etc

2020-08-05 Thread Tim McLarnan
OK, my error. I had multiple versions of R installed, one through conda and a global R. Naturally, this caused problems. Everything is now good. Thanks, all! Amateurs like me still find this whole process a little daunting; I wouldn't have figured it out without your help. I wish it were

[sage-support] Re: Reduction over Ideal

2020-08-05 Thread Nils Bruin
On Wednesday, August 5, 2020 at 10:19:57 AM UTC-7, john_perry_usm wrote: > > > It's possible that you want a local term ordering. Unlike global term > orderings, in a local ordering 1>t for any monomial t. > > TO = TermOrder("negdegrevlex",3) > R = PolynomialRing(GF(2),'x',3,order=TO) >

[sage-support] Re: Jupyter kernels for R, gp, gap, etc

2020-08-05 Thread Tim McLarnan
Thank you so much! I’m almost there. Isuru’s suggestion of using conda looked like it might be the simplest thing, but Nils’ post was very informative. I’m learning good stuff. Massive thanks to both of you! So I installed conda, which installed Python 3.8. I couldn’t then Sage 9.1,

[sage-support] Re: Reduction over Ideal

2020-08-05 Thread john_perry_usm
On Wednesday, August 5, 2020 at 6:28:42 AM UTC-5, Santanu wrote: > > Dear all, > Consider ideal I= over the binary field GF(2). > Then (x2).reduce(I) gives x2. I want it to be x0*x1. > In fact , I want this kind of reduction always should give quadratic > polynomial > (I know that this is

[sage-support] Re: Jupyter kernels for R, gp, gap, etc

2020-08-05 Thread Tim McLarnan
Thank you so much! I’m almost there. Isuru’s suggestion of using conda looked like it might be the simplest thing, but Nils’ post was very informative. I’m learning good stuff. Massive thanks to both of you! gap and gp are fine, *but not R*. Here's what I did: I installed conda,

[sage-support] Re: Reduction over Ideal

2020-08-05 Thread Nils Bruin
On Wednesday, August 5, 2020 at 4:28:42 AM UTC-7, Santanu wrote: > > Dear all, > Consider ideal I= over the binary field GF(2). > Then (x2).reduce(I) gives x2. I want it to be x0*x1. > In fact , I want this kind of reduction always should give quadratic > polynomial > (I know that this is

[sage-support] Reduction over Ideal

2020-08-05 Thread Santanu Sarkar
Dear all, Consider ideal I= over the binary field GF(2). Then (x2).reduce(I) gives x2. I want it to be x0*x1. In fact , I want this kind of reduction always should give quadratic polynomial (I know that this is possible for my problems). -- You received this message because you are