Re: [sage-devel] Sagemath Conway polynomials error from Conda Forge

Thanks. I was having other issues with building the regular way and went to Conda. I’ll try again and document better. Sent from my iPad > On Mar 10, 2019, at 3:15 PM, Dima Pasechnik wrote: > > On Sun, Mar 10, 2019 at 10:06 PM Steven Craighead > wrote: >> >> I have

[sage-devel] Sagemath Conway polynomials error from Conda Forge

I have tried to build SageMath from Conda Forge multiple times and it continually fails out due to the fact that the Conway polynomial package is too old. Who on sage development works with updating Conda Forge. I’m running the latest miniconda3 on an older Mac laptop with a current MacOS.

Re: [sage-devel] sage installation

Did you run ./configure Or ./configure —help And read any messages of problems? You may be able to just run Sudo app-get -f ecl.16.1.2.pt Also, consider doing sudo app-get on any packages that fail from the ./configure step. Also, you may need to set SAGE_LOCAL to some useable directory on

Re: [sage-devel] Re: Bug in sage.sat.boolean_polynomials.solve() with CryptoMiniSat 5.0.1

Mate, do you run Bosphorus from SageMath? Get Outlook for iOS From: sage-devel@googlegroups.com on behalf of Mate Soos Sent: Monday, December 17, 2018 3:10 PM To: sage-devel Subject: Re: [sage-devel] Re: Bug in

Re: [sage-devel] sage installation

I installed everything under my user directory and had to have sage completely compile from source. I was then able to use that version. The standard Ubuntu’s install didn’t work, so the one day source install was required. I also made sure I had all of the needed packages to compile

Re: [sage-devel] Re: Bug in sage.sat.boolean_polynomials.solve() with CryptoMiniSat 5.0.1

Once I got cryptominisat installed, I was able to replicate the bug. I also rearranged the equations and got it to solve as well, without rearranging the order of the variables. Sent from my iPhone > On Dec 13, 2018, at 11:58 AM, Sébastien Labbé wrote: > > I tested cryptominisat, picosat

Re: [sage-devel] Bug in sage.sat.boolean_polynomials.solve() with CryptoMiniSat 5.0.1

of CryptoMinISat :) Let me know what the issue is and I will > debug :) Please explain what you tried doing, what failed and what you think > the problem might be. I'll try to help to the best of my ability and time! > > Cheers, > > Mate > >> On Monday, 10 Decemb

Re: [sage-devel] Bug in sage.sat.boolean_polynomials.solve() with CryptoMiniSat 5.0.1

I'm trying to install cryptominisat for SAGEMATH 8.4. I'm hitting a wall. Any advice? On Sun, Dec 9, 2018 at 10:20 AM Steven Craighead wrote: > Equations three through six in keqs are nonlinear. I would expect if you > left the var1 order alone and permuted the order of the equatio

Re: [sage-devel] Bug in sage.sat.boolean_polynomials.solve() with CryptoMiniSat 5.0.1

Equations three through six in keqs are nonlinear. I would expect if you left the var1 order alone and permuted the order of the equations you might even get different answers. For instance if you swapped equation one with equation nine, you might get the same answer with the standard order

Re: [sage-devel] Bug in sage.sat.boolean_polynomials.solve() with CryptoMiniSat 5.0.1

Isn’t this like a situation that requires Groebner bases? Your equations can’t be solved when your variables go from 0 to 28, but can from 28 to 0. This might be a neat little research problem figuring out why you need a specific order on your variable list. Sent from my iPad > On Dec 9,

Re: [sage-devel] Re: Weak references in the coercion model

ote: > > Hi Steven, > >> On 2018-12-05, Steven Craighead wrote: >> How difficult is it to create a stack that can control the order of objects >> being created and destroyed so you prevent leaks? Can you add a new method >> on your base class that is inherited to all ch

Re: [sage-devel] Re: Weak references in the coercion model

How difficult is it to create a stack that can control the order of objects being created and destroyed so you prevent leaks? Can you add a new method on your base class that is inherited to all children to track this? Sent from my iPad > On Dec 4, 2018, at 6:54 PM, David Roe wrote: > > >

Re: [sage-devel] Re: Weak references in the coercion modeled

No sarcasm intended. I used to work at a software development firm and we were forced to use c++. Most of the back and forth that I have been observing with the team is around memory leaks and I just wondered if that is due to your development language choice. Hence, my comment. However, if

Re: [sage-devel] Re: Weak references in the coercion model

Would it be advisable to change the base programming language to one that does automatic garbage collection instead of having to check to see if a class has been properly disposed like it appears from all of these related bugs? Sent from my iPhone > On Dec 4, 2018, at 12:44 PM, Jeroen Demeyer

[sage-devel] the command: "E = EllipticCurve('14a1') K. = E.division_field(5); K" never finishes

E = EllipticCurve('14a1') K. = E.division_field(p); K for p = 2 and 3 finishes quickly. When I use p = 5 or p = 7, the command never finishes. I use Sagemath 8.4 on a linux mint 19. This is a toshiba AMD Turion II Dual Core Process M500 with 4GB ram. This is a Pentium 64-bit. -- You