On 2010-Feb-28 01:48:35 +, "Dr. David Kirkby"
wrote:
>and dirty ugly patch, I've changed the call to 'top' from one to 'prstat' on
>Solaris. Unlike 'top', 'prstat' is standard command.
>
>I call it 'ugly' as I don't think calling 'prstat' it an ideal way, but it is
>better than calling 'top
On 2010-Feb-28 21:32:10 -0800, Ondrej Certik wrote:
>On Sun, Feb 28, 2010 at 8:36 PM, William Stein wrote:
>> On Sun, Feb 28, 2010 at 7:34 AM, Bjarke Hammersholt Roune
>> wrote:
>>> Can a standard spkg in Sage use CMake?
...
>> No, at present, it is definitely not OK for a standard spkg to use C
On Sun, Feb 28, 2010 at 8:36 PM, William Stein wrote:
> On Sun, Feb 28, 2010 at 7:34 AM, Bjarke Hammersholt Roune
> wrote:
>> Can a standard spkg in Sage use CMake?
>>
>> http://www.cmake.org/
>>
>> I ask because I'm seriously considering moving from a straight make
>> system for Frobby to CMake
On Sun, 28 Feb 2010 at 09:02PM +0100, Burcin Erocal wrote:
> After the recent thread about Google Summer of Code [1], I set up a
> wiki page to collect project ideas:
>
> http://wiki.sagemath.org/gsoc10
>
> [1] http://groups.google.com/group/sage-devel/t/8f61382c855ddb09
>
> The application win
On Sun, Feb 28, 2010 at 7:34 AM, Bjarke Hammersholt Roune
wrote:
> Can a standard spkg in Sage use CMake?
>
> http://www.cmake.org/
>
> I ask because I'm seriously considering moving from a straight make
> system for Frobby to CMake, but if that is not possible for Sage then
> it's a non-starter.
Hi David,
I have produced a source tarball that incorporates the patches and/or
spkg's at the following tickets:
* #7867
* #8391
* #8363
* #8374
* #8375
These patches and spkg's are applied on top of Sage 4.3.3. The build
is still going on these machines:
* sage.math
* bsd.math
* winxp1 (Cygwin
Hi folks,
Gregory McWhirter has put a lot of effort into upgrading the NetworkX
spkg to version 1.0.1. At ticket #7608 [1] is a (roughly) 500 KB patch
to the Sage library and an upgraded NetworkX spkg. Don't let the size
of the patch put you off. Most of the patch is about removing trailing
white
Hi,
I want to raise this issue again.
sage: P. = PolynomialRing(QQ,2)
sage: f = 2*x*y+x+y
sage: f.coefficient({x:1,y:1})
2
sage: c = f.coefficient({x:1,y:1})
sage: c.parent()
Multivariate Polynomial Ring in x, y over Rational Field
sage: c = f.monomial_coefficient(x*y)
sage: c.parent()
Rational
Hi David,
On Mon, Mar 1, 2010 at 12:49 PM, David Kirkby wrote:
> The problem reported at #7932 has been solved my Robert's undated
> Cython at #8163 fixes this issue.
Done.
--
Regards
Minh Van Nguyen
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from t
The problem reported at #7932 has been solved my Robert's undated
Cython at #8163 fixes this issue.
Dave
--
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...@googlegroups.com
For more options, visit this g
After the recent screw up, where 4.3.1 failed to build on Solaris, hopefully
4.3.4 should do.
I've got all the patches in place for 4.3.3 to build. Try it at
http://redstart.drkirkby.co.uk:8000/
The network and computer are slow, but you can see it works. Also note that
both:
sage: top()
an
Hi Sage-devel,
I am currently experiencing some problems when comparing elements of a
QuadraticField. See below.
sage: Q. = QuadraticField(3)
sage: 0 < sqrt3
False
sage: RR(sqrt3)
1.73205080756888
The operator < and > do not correspond :
sage: sqrt3 > Q.zero()
True
sage: Q.zero() < sqrt3 #not
Primarily what I'm wondering is if there is already a good way to do
this, since I'm not volunteering to implement it if there isn't.
Still, I don't suppose it hurts to mention what I would like. For
polynomial rings, it would be a function along the lines of
makeSomeRing(predicate)
where pred
Hi,
I will watch the videos next week and upload them to sageworldmath.blip.tv
Meanwhile you can have a look at
http://sageworldmath.mirocommunity.org/
just created
#Serge
Sébastien Labbé пишет:
>> the Videos of Sage Days 20 [1] will be available here
>
> The initial format of the videos are
Hi Bjarke!
On 28 Feb., 17:18, Bjarke Hammersholt Roune
wrote:
> Is it possible to write a test that runs over all polynomial ring over
> a field in Sage? This is as opposed to a test that works in a specific
> ring that the test constructs. Obviously there are infinitely many
> possible rings tha
Hi,
After the recent thread about Google Summer of Code [1], I set up a
wiki page to collect project ideas:
http://wiki.sagemath.org/gsoc10
[1] http://groups.google.com/group/sage-devel/t/8f61382c855ddb09
The application window for mentoring organizations opens in a week, so
we need to be qui
Hi David,
On Mon, Mar 1, 2010 at 2:50 AM, Dr. David Kirkby
wrote:
> Do the auto generated files need to be checked in?
I think so. The cddlib package checks in autogenerated files under patches/.
--
Regards
Minh Van Nguyen
--
To post to this group, send an email to sage-devel@googlegroups
Hello everybody
I just submitted to trac a new patch which I hope will be the beginning of a
long sequence in graph Theory. This patch lets one computes, given two
graphs G and H, whether G has H as a minor. it is based on linear
programming, and often slow, but there are very few if any prac
Bjarke Hammersholt Roune wrote:
I think the silently wrong Grobner basis has a chance to result in
wrong papers, so that would be my top pick
http://trac.sagemath.org/sage_trac/ticket/6472
and I agree on the startup time
http://trac.sagemath.org/sage_trac/ticket/8254
I just put a commen
I think the silently wrong Grobner basis has a chance to result in
wrong papers, so that would be my top pick
http://trac.sagemath.org/sage_trac/ticket/6472
and I agree on the startup time
http://trac.sagemath.org/sage_trac/ticket/8254
--
To post to this group, send an email to sage-devel@
Is it possible to write a test that runs over all polynomial ring over
a field in Sage? This is as opposed to a test that works in a specific
ring that the test constructs. Obviously there are infinitely many
possible rings that can be constructed, so the test should run over
some representative fi
I've had to create a patch for Solaris to python.
http://trac.sagemath.org/sage_trac/ticket/7867
The changes consist of applying a small (< 1 KB) patch downloaded from the
python web site to configure.in, then remaking the configure script.
Python's configure.in is quite large (107 KB) and th
Can a standard spkg in Sage use CMake?
http://www.cmake.org/
I ask because I'm seriously considering moving from a straight make
system for Frobby to CMake, but if that is not possible for Sage then
it's a non-starter. A search of sage-devel reveals that Singular is
moving to CMake, but it isn'
Dr. David Kirkby wrote:
I thought I'd report the doctests results on Solaris. I know Solaris has
never passed them all, but the number of failures is not very large now
I've implemented something much faster to get the memory usage, which
was screwing up some tests.
There are 10 failures. Th
Hi Nathann,
On Mon, Mar 1, 2010 at 1:44 AM, Nathann Cohen wrote:
> This should be easy to fix in c_graph.pyx or directly in the backends
> for dense/sparse graphs.
This is now ticket #8395
http://trac.sagemath.org/sage_trac/ticket/8395
--
Regards
Minh Van Nguyen
--
To post to this group,
> Given a graph G with one vertex v having a self-loop at v, I would
> expect the total degree of G to be 2, since the total degree is twice
> the number of edges. But this is not the case as shown below for the
> case of undirected (multi)graphs:
I never use looped graphs or multigraphs, but I ag
Hi folks,
Given a graph G with one vertex v having a self-loop at v, I would
expect the total degree of G to be 2, since the total degree is twice
the number of edges. But this is not the case as shown below for the
case of undirected (multi)graphs:
[mv...@sage mvngu]$ sage
--
Alex Ghitza wrote:
On Sun, 28 Feb 2010 12:29:52 +, "Dr. David Kirkby"
wrote:
Is there way I can increase the timeout for doctests? I've got some failures,
but note that some tests are taking very close to the maximum permitted (360s)
on my 900 MHz SPARC.
Hi Dave,
Have a look at the fol
On Sun, 28 Feb 2010 12:29:52 +, "Dr. David Kirkby"
wrote:
> Is there way I can increase the timeout for doctests? I've got some failures,
> but note that some tests are taking very close to the maximum permitted
> (360s)
> on my 900 MHz SPARC.
Hi Dave,
Have a look at the following ticket
I thought I'd report the doctests results on Solaris. I know Solaris has never
passed them all, but the number of failures is not very large now I've
implemented something much faster to get the memory usage, which was screwing up
some tests.
There are 10 failures. The first two are failures
Is there way I can increase the timeout for doctests? I've got some failures,
but note that some tests are taking very close to the maximum permitted (360s)
on my 900 MHz SPARC.
For example
sage -t "devel/sage/doc/en/bordeaux_2008/birds_other.rst"
[203.8 s]
sage -t "devel/sage/sage
> However, I find them completely *impossible* to download. The site
> seems to be secure, e.g., and I simply can't get the worksheets.
Indeed, one must accept the certificate to access to the web site (I
learned the solution by the web site maintainer himself).
> Maybe you could also upload the
On Sun, 28 Feb 2010 22:22:48 +1100, Alex Ghitza wrote:
> It looks good to me, with one exception: "Author(s)" refers to the
> authors of the patch(es) or other code attached to the ticket, not to
> the person creating the ticket itself (that's covered by "Reported by").
Oops. I just looked at th
On Sat, 27 Feb 2010 23:55:43 -0800 (PST), Drini wrote:
> Since it's the first time I submit a bug report, I'm not sure if I did
> it properly.
>
> I just want to know if I didn't mess up, filling bad the values and
> boxes below the report.
Hi,
It looks good to me, with one exception: "Author(s
34 matches
Mail list logo
