Hello all,
Sage 4.3.alpha1 is out. This should be pretty close to the final
release for 4.3. Source and binary are available at
http://sage.math.washington.edu/home/mhansen/release/4.3/alpha1/sage-4.3.alpha1.tar
http://sage.math.washington.edu/home/mhansen/release/4.3/alpha1/sage-4.3.alpha1-sage
OK, here's the input I tried:
kk:1;
ll:10;
dz:1;
ghomo(zl,zg):= 2/ll*sin(kk*zl)*sin(kk*(ll-zg))/(kk*sin(kk*ll)) ;
gfourn(z,zd,n):=sin(npi*n*z/ll)*sin(npi*n*zd/ll)/((npi*n/ll)^2 -
kk^2) ;
uhomo(z):=integrate(ghomo(zl,z)*f1(zl),zl,0,z)+integrate(ghomo(z,zg)*f1
(zg),zg,z,ll);
ufourn(z,n):=makelist(in
2009/12/3 Harald Schilly :
> Hi, I got this from the "report a problem" link in the notebook. I can
> confirm it in my local 4.2.1 and sagenb.org. Could someone please
> forward this to libsingular?
I've made this to
http://trac.sagemath.org/sage_trac/ticket/7597
>
> Segfault in libsingular
2009/12/3 Harald Schilly :
> On Dec 3, 6:21 pm, Robert Bradshaw
> wrote:
>> Yep. We don't want a repeat of the .7zip fiasco ...
>
> i don't know how big it was, but linux users are a bit different from
> windows users. also for example for me on ubuntu extracting a .lzma
> tar in nautilus (gnome f
2009/12/3 j. arias-de-reyna :
> Hello everybody,
>
> I have composed a program (in Python using the mpmath library) to
> compute to
> high precision zeta(s) and Z(t) (the Riemann-Siegel function) by
> means of the Riemann-Siegel expansion.
>
> I have obtained, I think that for the first time, rigo
OK found the bug. There is a program called get_Shift which gets
confused by zero vectors. In any call to Babai if you just add a line
setting n = the number of columns of B (I'm not sure his notation in
the C++ version) then it works again.
On Dec 3, 4:56 pm, AndyNovo wrote:
> I meant FLINT.
>
On Thu, 03 Dec 2009 at 05:12AM -0800, Harald Schilly wrote:
> Is the compression ratio the same?
From the pbzip2 manpage:
> Files that are compressed with pbzip2 are broken up into pieces and
> each individual piece is compressed. This is how pbzip2 runs faster
> on multiple CPUs since the pi
> Yes, have a look at sage/groups/group.pyx. It has a FiniteGroup
> class, where I think you should put your main method (that's what
> Florent said as well, I think).
Yep ! This will probably needs some cleanup when we will merge categories with
the other generic stuff but I think this is the ri
Hi Javier,
On Thu, Dec 03, 2009 at 11:03:43AM -0800, Robert Bradshaw wrote:
> On Dec 3, 2009, at 10:04 AM, javier wrote:
>
> > This also makes sense. I don't really know which choice would be
> > better. Maybe having both, doing something like
> >
> > def conjugacy_class(self):
> >G = self.p
Hi Juan!
On 3 Dez., 19:55, "j. arias-de-reyna" wrote:
[...]
> So, my fear is that my program although running, must have many
> mistakes of a beginner. Also I think the program can be made faster
> with some modifications, for example: using a C-implementation to
> compute the zeta sum.
In Sage
Mike Hansen wrote:
> On Sun, Nov 22, 2009 at 9:24 PM, Dr. David Kirkby
> wrote:
>> Well, we would need agreement on exactly what to have on the pull-down until
>> I
>> could do that.
>>
>> I assume the necessary code to add to the configuration file would be very
>> similar to that used on Type,
>
> Dunno what's going on here, but when I try this in Maxima 5.19.2
> it works OK (I get a list of values from ufourn).
> I can post a session log later if there is interest.
>
Robert et al.,
Yes, please do post a log - there may some additional Maxima commands
called by Sage that trigger this t
On Dec 3, 6:21 pm, Robert Bradshaw
wrote:
> Yep. We don't want a repeat of the .7zip fiasco ...
i don't know how big it was, but linux users are a bit different from
windows users. also for example for me on ubuntu extracting a .lzma
tar in nautilus (gnome file manager) is just right-click "extra
On Dec 3, 7:09 am, javier wrote:
> My question: would it be interesting to include the wrapper for the
> GAP function in sage?
+1
There are places where Sage/GAP just give you one of something, when
you might want all of them, and it is simply conjugacy that will
produce them all. For small e
> kk = 1.0
> ll = 10.0
> npi = N(pi)
> var('z, zd, zl, zg, zz')
>
> dz = 1.0
> zs = pylab.arange(0.0, ll+0.5*dz, dz)
>
> f1 = lambda z: z*(ll-z)
>
> ghomo = lambda zl, zg: 2/ll*sin(kk*zl)*sin(kk*(ll-zg))/(kk*sin(kk*ll))
> gfourn = lambda z, zd, n: sin(npi*n*z/ll)*sin(npi*n*zd/ll)/((npi*n/ll)^2 -
>
On Dec 3, 2009, at 10:04 AM, javier wrote:
> Hi there,
>
> On Dec 3, 5:08 pm, Florent Hivert
> wrote:
>> However, I thing it should be a method of the group:
>>G.conjugacy_class(g).
>
> that was my original idea, to keep it close to GAP original
> definition.
>
>> Or even of the element itsel
Hello everybody,
I have composed a program (in Python using the mpmath library) to
compute to
high precision zeta(s) and Z(t) (the Riemann-Siegel function) by
means of the Riemann-Siegel expansion.
I have obtained, I think that for the first time, rigorous bounds
for the terms and rest of the Ri
On Dec 3, 2009, at 3:58 AM, Dr. David Kirkby wrote:
> There is a program called 'Parallel BZIP2 (PBZIP2)'
>
> http://compression.ca/pbzip2/
>
> which does exactly what you would think from its name. Detecting if
> it exists,
> and if so using it in preference to bzip2 would be very easy.
>
> The
Hi there,
On Dec 3, 5:08 pm, Florent Hivert
wrote:
> However, I thing it should be a method of the group:
> G.conjugacy_class(g).
that was my original idea, to keep it close to GAP original
definition.
> Or even of the element itself since it knows G as it's parent:
> g.conjugacy_class()
On Dec 3, 2009, at 2:04 AM, Harald Schilly wrote:
> On Dec 3, 3:48 am, Dr David Kirkby wrote:
>> Harald has clearly shown there are dramatic savings in space for lzma
>> compression compared to both bzip2 and gzip...
>
> The real win is for the binaries. I've written a simple script that
> conver
On Dec 3, 2009, at 2:16 AM, Harald Schilly wrote:
> Hi, I got this from the "report a problem" feedback form:
>
> Setting algorithm='mathematica_free' in integral() merges lowercase
> and uppercase variables
>
> Consider the following Sage code:
>
> sage: clear_vars()
> sage: var('D F k r w x X z'
> And finally for those groups who are not known to gap, the fallback
> (sage-only) method should be in the category FiniteGroups to be inherited by
> any group.
Speaking of such groups, this is a bit mysterious (sometimes a
calculation will say to download the optional database, sometimes no
err
Dear Javier,
> > sage: def conjugacy_class(g,G):
> > ... cc = Set([x*g*x^(-1) for x in G])
> > ... return cc
> >
> > this feels very pythonic and works just fine, but is terribly
> > inefficient since it requires a lot of computations and stores in
> > memory an array of the whol
Hi, I got this from the "report a problem" link in the notebook. I can
confirm it in my local 4.2.1 and sagenb.org. Could someone please
forward this to libsingular?
Segfault in libsingular The following code crashes sage. I tried with
a few different versions, including sagenb.org.
F2 = GF(2)
F.
On Dec 2, 10:39 am, Philippe Teuwen wrote:
> After upgrade from 3.4 to 4.2.1 I tried to access from the notebook,
> logged as admin, I try to access the "notebook settings" page and get:
> [...]
> Any idea?
Given the extent of changes to the notebook from Sage 3.4 to 4.2.1, it
may be easiest now
2009/12/3 javier :
> Hi all,
>
> I have been lately doing some work that required me to explicitly
> compute conjugacy classes of certain finite groups.
>
> Since in sage there is no built-in function for that I defined my own
> in the obvious straight-forward way:
>
> sage: def conjugacy_class(g,G
I meant FLINT.
On Dec 3, 4:56 pm, AndyNovo wrote:
> Yeah I told Damien Stehle, I have to fix it for SAGE anyway so we'll
> figure out where the bug is soon. Just thought I would tell you guys
> here.
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from th
Yeah I told Damien Stehle, I have to fix it for SAGE anyway so we'll
figure out where the bug is soon. Just thought I would tell you guys
here.
--
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...@googleg
To take up less room here is a 64-bit breaker just copy and paste this
line into SAGE (it tells me 6!=0 as the error).
matrix
([[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
> Here's a simple lattice which triggers the bug on my 32 bit machine.
> (It's the zero rows which are not handled cleanly causing it to size
> reduce in very odd ways...) For a 64 bit machine I have a much larger
> example which breaks it.
>
> [[0 0 0 0 0]
> [0 0 0 0 0]
> [1 0 0 0 11]
> [0 1 0 0
We've been working on factoring polynomials in FLINT very intensively
the last couple months. So we've been making floating point LLL in
FLINT. During the process I just discovered what I thought was my bug
but is actually a bug in fpLLL which means it's a bug in SAGE too.
Here's a simple lattic
Harald Schilly wrote:
> On Dec 3, 12:58 pm, "Dr. David Kirkby"
> wrote:
>> I've not checked out the claims of the speedup (in fact, I've not even
>> downloaded its source code yet), but assuming it does work reaonsably well,
>> what
>> are your thoughts on implementing this?
>
> Is the compressi
Hi all,
I have been lately doing some work that required me to explicitly
compute conjugacy classes of certain finite groups.
Since in sage there is no built-in function for that I defined my own
in the obvious straight-forward way:
sage: def conjugacy_class(g,G):
... cc = Set([x*g*x^(-1)
On Dec 3, 12:58 pm, "Dr. David Kirkby"
wrote:
> I've not checked out the claims of the speedup (in fact, I've not even
> downloaded its source code yet), but assuming it does work reaonsably well,
> what
> are your thoughts on implementing this?
Is the compression ratio the same? I've nothing ag
Dear Minh,
Thank you for your hints! It worked, and actually needed less than
"about 20 minutes to 1 hour".
So, now I can hopefully start to review the new libsingular patches.
Cheers,
Simon
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group,
Hi Simon,
On Thu, Dec 3, 2009 at 8:34 PM, Simon King wrote:
> 10. sage: hg_sage.status()
> Getting status of modified or unknown files:
> cd "/home/SimonKing/sandbox/sage-4.3.alpha0/devel/sage" && hg
> status
> ! doc/fr/a_tour_of_sage/eigen_plot.png
> ! doc/fr/a_tour_of_sage/si
There is a program called 'Parallel BZIP2 (PBZIP2)'
http://compression.ca/pbzip2/
which does exactly what you would think from its name. Detecting if it exists,
and if so using it in preference to bzip2 would be very easy.
There is an option:
-l : load average determines max number processors
Hi, I got this from the "report a problem" feedback form:
Setting algorithm='mathematica_free' in integral() merges lowercase
and uppercase variables
Consider the following Sage code:
sage: clear_vars()
sage: var('D F k r w x X z')
(D, F, k, r, w, x, X, z)
sage: r = sqrt((X-x)^2 + z^2)
sage: F =
On Dec 3, 3:48 am, Dr David Kirkby wrote:
> Harald has clearly shown there are dramatic savings in space for lzma
> compression compared to both bzip2 and gzip...
The real win is for the binaries. I've written a simple script that
converts tar.gz binaries into tar.lzma binaries. Currently, I'm
mi
On Wed, Dec 02, 2009 at 08:03:33AM -0800, Robert Bradshaw wrote:
> On Dec 2, 2009, at 2:46 AM, Alex Ghitza wrote:
>
> >
> > The docstring for CyclotomicField says that "Due to their default
> > embedding into `\CC`, cyclotomic number fields are all compatible."
> > and goes on to show some operati
Hi Carlo,
I'll elaborate a bit more what I did and what happened.
1. Untar and make sage-4.3.alpha0 on sage-math.
2. Wait a few hours, play with ./sage
(I didn't do ./sage -testall, though)
3. Do ./sage -clone infinitepoly before sleeping (in a screen session,
if that's relevant
4. Next morni
On Thu, Dec 3, 2009 at 10:11 AM, Simon King wrote:
> That's a different patch.
Oops.
> But now, as you say it: Could it be the the patch from 7577 is already
> merged? Although the ticket is "needs-info"?
I don't think 7577 has been applied in 4.3.alpha0, e.g. around line
213 of sage/libs/singu
On Dec 3, 9:01 am, Carlo Hamalainen
wrote:
> On Thu, Dec 3, 2009 at 9:32 AM, Simon King wrote:
> > In fact, it seems to me that sage-4.3.alpha0 is foobar.
>
> I can make a clone in 4.3.alpha0 from a clean install (takes about 1.5
> minutes) but the 7577 patch doesn't do anything:
That's a diff
On Thu, Dec 3, 2009 at 9:32 AM, Simon King wrote:
> In fact, it seems to me that sage-4.3.alpha0 is foobar.
I can make a clone in 4.3.alpha0 from a clean install (takes about 1.5
minutes) but the 7577 patch doesn't do anything:
ca...@blah:~/sage/devel/sage$ hg qinit
ca...@blah:~/sage/devel/sage$
In fact, it seems to me that sage-4.3.alpha0 is foobar.
After returning to sage-main, I tried to apply a patch:
sage: hg_sage.import_patch('patches/singular_prcopyr_no7577.patch')
cd "/home/SimonKing/sandbox/sage-4.3.alpha0/devel/sage" && hg status
/home/SimonKing/sandbox/sage-4.3.alpha0/local/lib
Hi!
I installed sage-4.3.alpha0, and tried to make a clone. The cloning
process hanged, it did not finish within 8 hours!
It was on sage-math.
Cheers,
Simon
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel-unsub
46 matches
Mail list logo
