What is the problem with:
> you are running out of primes. 1000 coprime primes found
Should I be concerned?
It was printed during one of my rather long running computations.
'Sage Version 5.9, Release Date: 2013-04-30'
OSX, 64 bit.
--
You received this message because you are subscribed to
Is it faster to switch to using the mobius_function_matrix if I only want
the intervals starting from zero?
I'm also confused about what it means by the linear extension.
The part of my code in question is
F = []
for i in range(M.rank()+1):
F.extend(M.flats(i))
P = Poset((F
This has cut my computation time to a hundredth of that it was, thanks.
On Wednesday, 22 May 2013 01:10:40 UTC-4, Jeroen Demeyer wrote:
>
> On 05/22/2013 12:24 AM, Michael Orlitzky wrote:
> > Singular (included in sage) has a library that can quickly count the
> > number of real roots in an inte
y rare, if it ever happens, but I really
don't want to miss any of those cases.
On Tuesday, 21 May 2013 08:53:14 UTC-4, Jason Grout wrote:
>
> On 5/21/13 7:39 AM, Theo Belaire wrote:
> > I haven't explicitly set the ring it's working over, but all the entries
> >
I haven't explicitly set the ring it's working over, but all the entries of
the matrix are integral.
On Monday, 20 May 2013 20:37:55 UTC-4, William wrote:
>
> On Mon, May 20, 2013 at 2:19 PM, Theo Belaire
> > wrote:
> > I have a large computation where I n
I have a large computation where I need to compute the number of positive
eigenvalues of a matrix.
I am currently computing all the eigenvalues then counting how many are
positive, but I see when profiling that "{method 'roots' of
'sage.rings.polynomial.polynomial_element.Polynomial' objects}" i
