On Feb 22, 8:29 am, "Michael.Abshoff" <[EMAIL PROTECTED]>
wrote:
> Could you please post slightly more of the log? It looks like it happens
> during "make install" which would make it easy to fix. Is it reproducible?
I built again with -j1, now the build was fine. I'm going to run
doctests on
Is this a bug?
sage: version()
'Sage Version 3.4.2, Release Date: 2009-05-05'
sage: S. = PolynomialRing(Integers(14641))
sage: f = 1 + 9581*t
sage: R = PolynomialRing(Integers(1331), "t")
sage: ff = f.change_ring(R)
sage: ff
264*t + 1
sage: type(f)
sage: type(ff)
sage: ff[0]
264*t + 1
sage: f[0
On Dec 13, 4:46 pm, John H Palmieri wrote:
> I was thinking of adding some doctests, so I was looking at
> algebra_ideal.py. Now I'm confused.
>
> The file has lines (plus some documentation, which I'm omitting):
>
> class AlgebraIdeal(object):
> def __init__(self, A, gens = []):
>
On Jan 14, 5:41 pm, Bill Hart wrote:
> There's only one conclusion possible. The Schoenhage/Nussbaumer FFT
> David has written in zn_poly for multiplication of polys over Z/pZ is
> truly much better on Intel than the Kronecker Segmentation/Schoenhage-
> Strassen FFT method used in FLINT.
zn_pol
--
| Sage Version 3.4, Release Date: 2009-03-11 |
| Type notebook() for the GUI, and license() for information.|
--
sage: M = matr
Hi,
The constructor for hyperelliptic curves has the following signature:
def HyperellipticCurve(f,h=None,names=None,PP=None)
but the code doesn't seem to use the PP parameter anywhere, and there
are no examples of its use in the docstring. In fact the first thing
the code does with PP is overw
When I google for "sage math", I get mathematica ads on the right. Is
that something they would have done on purpose?
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-d
Hi folks,
I have made a basic spkg for GMP 4.3.0:
http://sage.math.washington.edu/home/dmharvey/gmp-4.3.0.spkg
I've only tested on a linux opteron system. It builds fine; there are
various doctest failures that look related to non-canonical XGCD
output. Quite possibly it won't yet
The "mysterious error in doctest" is my top vote, because it really
interrupts my workflow (trying to find the broken whitespace...):
http://trac.sagemath.org/sage_trac/ticket/7993
Then a few p-adic ones:
http://trac.sagemath.org/sage_trac/ticket/8240
http://trac.sagemath.org/sage_trac/ticket/8
Great, thanks! I will try to take a look today.
david
On Aug 27, 1:43 am, David Roe wrote:
> So, I have a patch up at #9814 which improves the situation.
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr
On Sep 9, 7:44 pm, cousteau wrote:
> On 9 sep, 18:24, David Harvey wrote:
>
> > Sage is very slow. I discovered this (again) while trying to write a
> > prototype of an algorithm for computing zeta functions of projective
> > varieties. I need to multiply lots of polynomials and matrices over
On Sep 10, 7:46 pm, William Stein wrote:
> On Friday, September 10, 2010, Tom Boothby wrote:
> >> The examples of slow things I gave are things that should be fast,
> >> even in the Sage interpreter. All of these things are fast in Magma
> >> for example, which is also an interpreted language, a
On Sep 10, 9:08 pm, Robert Bradshaw
wrote:
> sage: type(matrix(Integers(3^5), 5, 5))
>
> sage: type(matrix(Integers(3^20), 5, 5))
>
That certainly explains one of the issues.
Now watch me try to work around it:
sage: R = Integers(3^20)
sage: M1 = Matrix([[R.random_element() for i in range
On Sep 19, 6:25 pm, "David Harvey" wrote:
> Consider the following script, which saves a p-adic matrix and then
> repeatedly loads it into a list:
The same thing happens on sage 4.5.2 on mac OS.
I also tried using a different ring, i.e. with
K = Integers(13^10)
M = Matrix(K, [[K.random_element
On Sep 19, 9:12 pm, dmharvey wrote:
> For matrices over ZZ it doesn't seem to happen though. This suggests
> it is a bug in the generic matrix load() code.
Curiouser and curiouser it has nothing to do with matrices. Even
doing this causes the problem:
K = Intege
On Sep 19, 9:28 pm, dmharvey wrote:
>
> Curiouser and curiouser it has nothing to do with matrices. Even
> doing this causes the problem:
>
> K = Integers(13^10)
> M = [[K.random_element() for j in range(200)] for k in range(200)]
> save(M, "thing.sobj")
I hav
On Sep 19, 10:03 pm, Mitesh Patel wrote:
> Possibly very naive question: What happens to the times if you disable
> automatic garbage collection:
>
> import gc
> gc.disable()
>
> ?
Interesting clue yes that gets rid of the increasing times. So do
you think the garbage collection has some k
On Sep 19, 10:20 pm, dmharvey wrote:
> On Sep 19, 10:03 pm, Mitesh Patel wrote:
>
> > Possibly very naive question: What happens to the times if you disable
> > automatic garbage collection:
>
> > import gc
> > gc.disable()
>
> > ?
>
> Interest
On Sep 20, 3:47 am, koffie wrote:
> David: you are 100% right about the garbage collector.
>
> The following example sort of shows what is going on:
>
> from time import time
> import gc
> K = Qp(13, 10)
> M = [K.random_element() for j in range(200)]
> save(M,"thing.sobj")
> L = []
> for i in ran
On Mar 2, 8:29 pm, Jonathan Hanke wrote:
> Help out a fellow colleague with his promotion file. Have you ever
> used quadratic forms in Sage? If so, please send me an email at
> letting me know, or just respond to this email.
I have used them to help me figure out examples for a grad number
On Thursday, 6 June 2013 01:43:55 UTC+10, William wrote:
>
> > The zn_poly author seems to have some philosophical
> > issue against v3+ for some reason, though.
>
> Indeed. In the long run, maybe some new version of FLINT will
> completely subsume zn_poly in functionality, and we can remove
On Thursday, 6 June 2013 10:13:33 UTC+10, William wrote:
>
> On Wed, Jun 5, 2013 at 4:29 PM, dmharvey >
> wrote:
> >
> > On Thursday, 6 June 2013 01:43:55 UTC+10, William wrote:
> >
> > Would it help if I relicensed zn_poly under a BSD-style license?
&g
22 matches
Mail list logo
