[sage-support] Re: Modular operation in multivariate polynomials

Hi Oleksandr, On 16 Feb., 17:58, Oleksandr Kazymyrov wrote: > I am forcing the call of a function > pol.mod(P("y^8+y")) to obtain the remainder by modulus. Sorry, I had missed that (the example was quite long, and thus I had the impression that you had merely constructed a polynomial over a fini

[sage-support] Re: Sage 4.8 notebook/server error on OSX and Linux

As usually, one tries to find the error source several hours and then, after asking for help, one finds it in minutes. The problem was notebooks files got corrupted after a power outage. I've moved the directory to a backup location, recreated it by running Sage and then copied the old files fr

[sage-support] Sage 4.8 notebook/server error on OSX and Linux

Hi, I have just tried to move on to v4.8 and I have encountered an error, on both precompiled binaries for OSX 10.6 64bit (running on OSX 10.6.8) and on OpenSuse Linux 64bit (where Sage was compiled from sources, which went OK). The error is as following: on any worksheet, if a click "evaluate

[sage-support] Re: Modular operation in multivariate polynomials

Dear Simon, >> There is a difference between a polynomial (i.e., an element of a polynomial ring) and a polynomial function. Polynomials can be of arbitrary degree, over any coefficient field. Yes I know this. But I think there is no difference between defining of PolynomialRing and Polynomial

Re: [sage-support]

No, that I do not know. I run my code half an hour. But still donot get result. On 16/02/2012, William Stein wrote: > On Thu, Feb 16, 2012 at 9:53 AM, Santanu Sarkar > wrote: >> M2 is a (50, 50) matrix. Its entries are large (2048 bit). >> >> On 16 February 2012 09:32, William Stein wrote: >>>

Re: [sage-support]

On Thu, Feb 16, 2012 at 9:53 AM, Santanu Sarkar wrote: > M2 is a (50, 50) matrix. Its entries are large (2048 bit). > > On 16 February 2012 09:32, William Stein wrote: >> On Thu, Feb 16, 2012 at 9:23 AM, Santanu Sarkar >> wrote: >>> Hi all, >>>  I have used the function  E,N1=M2.hermite_form(tra

[sage-support] Re:

In gmane.comp.mathematics.sage.support, you wrote: > M2 is a (50, 50) matrix. Its entries are large (2048 bit). did you try 'algorithm="padic"' option, as suggested in the manual for such a case (small matrix, large entrie)? -- To post to this group, send email to sage-support@googlegroups.com T

[sage-support] Re: SAGE CPLEX

In gmane.comp.mathematics.sage.support, you wrote: > Hi Nathan, > > Yes, I checked local/include and local/lib. CPLEX runs fine also as a > 64 bit standalone. > I recompiled everything with ./sage -ba, and now > MixedIntegerLinearProgram(solver="CPLEX") triggers a new error > message it might

Re: [sage-support]

M2 is a (50, 50) matrix. Its entries are large (2048 bit). On 16 February 2012 09:32, William Stein wrote: > On Thu, Feb 16, 2012 at 9:23 AM, Santanu Sarkar > wrote: >> Hi all, >>  I have used the function  E,N1=M2.hermite_form(transformation=True) >> to compute the Hermite Normal Form and >>  o

Re: [sage-support]

On Thu, Feb 16, 2012 at 9:23 AM, Santanu Sarkar wrote: > Hi all, >  I have used the function  E,N1=M2.hermite_form(transformation=True) > to compute the Hermite Normal Form and >  observed  that it is very slow. Is there any better function? What is M2? > > -- > To post to this group, send email

[sage-support]

Hi all, I have used the function E,N1=M2.hermite_form(transformation=True) to compute the Hermite Normal Form and observed that it is very slow. Is there any better function? -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to

[sage-support] Re: Modular operation in multivariate polynomials

Hi Oleksandr, On 16 Feb., 14:09, Oleksandr Kazymyrov wrote: > I expect that the degree of the polynomial will be less than 2^bits=8. Why do you expect this? There is a difference between a polynomial (i.e., an element of a polynomial ring) and a polynomial function. Polynomials can be of arbitra

[sage-support] Modular operation in multivariate polynomials

Hi All, Code: sage: bits=3 sage: sage: k=GF(2^bits,'a') sage: P=PolynomialRing(k,1+bits+bits+bits-1+(1

[sage-support] Some bugs and some wishes

Hi there, here are some bugs which may or may not be already known. If they are new, could you please file them wherever such bugs need to be filed? Or if they are not bugs but wrong usage, could you explain to me what I should type instead? I am still working with version 4.7.1, so some re