mabshoff wrote:
> > Since Sage takes inspiration from Mathematica in so many other areas,
> > my thought is that using mathlink as a starting point for what a Sage
> > API should look like would make sense too.
>
> I think that API is just ludicrously heavy and way to complicated.
> Sage dev
OK -- I found these responses only on Friday morning (GMT) and had not
done anything about them anyway.
I was going to suggest replacing the code with
sage: A, gens = E.abelian_group(); A
Multiplicative Abelian Group isomorphic to C5
with a remark in the text that the actual generators sho
> this is 2.10.2.rc0, which hopefully will be identical to 2.10.2
> final.
I got four doctest failures on my OSX Intel 10.5 box:
sage -t devel/sage-main/sage/calculus/calculus.py
sage -t devel/sage-main/sage/rings/number_field/number_field.py
sage -t devel/sage-main
On Feb 21, 2008, at 10:15 PM, mabshoff wrote:
>
> Hello folks,
>
> this is 2.10.2.rc0, which hopefully will be identical to 2.10.2
> final.
> Please build and doctest this release and report any issue you
> come across. At this point only critical issues will be patched,
> i.e. doctest failures o
David Harvey wrote:
> On Feb 21, 2008, at 10:15 PM, mabshoff wrote:
>
>> Hello folks,
>>
>> this is 2.10.2.rc0, which hopefully will be identical to 2.10.2
>> final.
>> Please build and doctest this release and report any issue you
>> come across. At this point only critical issues will be patche
On Feb 22, 2008, at 8:29 AM, Michael.Abshoff 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?
http://sage.math.washington.edu/home/dmharvey/install.log.gz
I am going to try buil
Problems with sage-2.10.2.rc0:
1. One 32-bit REDHAT, 32-bit Debian (minimal),
The build completely fails at the "sage -br" part with:
...
sage/misc/sage_timeit_class.pyx -->
/home/was/build/sage-2.10.2.rc0/local//lib/python/site-packages//sage/misc/sage_timeit_class.pyx
running install
running bu
> Here are the pow_computer failures:
> sage -t devel/sage-main/sage/rings/padics/pow_computer.pyx
> **
> File "pow_computer.pyx", line 160:
>sage: PC._pow_mpz_t_tmp_demo(6, 8)
> Expected:
>244140625
> Got:
>1525878906
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Nothing extraordinary: built and tested on dual core
laptop running Gentoo. Everything is ok except for the
two number_field test failures already reported by others.
Best,
Alex
mabshoff wrote:
| Hello folks,
|
| this is 2.10.2.rc0, which hopefull
On Friday 22 February 2008, Craig Citro wrote:
> > this is 2.10.2.rc0, which hopefully will be identical to 2.10.2
> > final.
>
> I got four doctest failures on my OSX Intel 10.5 box:
>
> sage -t devel/sage-main/sage/calculus/calculus.py
> sage -t devel/sage-main/sage/rings/num
On Feb 22, 6:37 pm, bill purvis <[EMAIL PROTECTED]> wrote:
> On Friday 22 February 2008, Craig Citro wrote:> > this is 2.10.2.rc0, which
> hopefully will be identical to 2.10.2
> > > final.
>
> > I got four doctest failures on my OSX Intel 10.5 box:
>
> > sage -t devel/sage-main/sage
Wow, this discussion blew up way to fast for me to keep on top of it and
form a coherent opinion. Ted, I'm specifically CCing you; if you don't
want to reply (either on or off list), I understand. Personally, I'd
like to keep working on some the issues that I find interesting and I
think you
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
On Fri, Feb 22, 2008 at 1:09 PM, Jason Grout
<[EMAIL PROTECTED]> wrote:
>
> Wow, this discussion blew up way to fast for me to keep on top of it and
> form a coherent opinion. Ted, I'm specifically CCing you; if you don't
> want to reply (either on or off list), I understand. Personally, I'd
Thanks, Jason, for the lengthy reply. I think it summarizes things
nicely.
I started a simple API at the AMS meeting in January, and I think the
time is ripe to have a discussion about this. I'll start a new thread
summarizing my ideas (probably on sage-edu) when I have a bit more
time (p
On Feb 22, 10:45 am, "Craig Citro" <[EMAIL PROTECTED]> wrote:
> > this is 2.10.2.rc0, which hopefully will be identical to 2.10.2
> > final.
>
> I got four doctest failures on my OSX Intel 10.5 box:
>
> sage -t devel/sage-main/sage/calculus/calculus.py
> sage -t devel/sage-ma
On Feb 22, 4:21 pm, David Harvey <[EMAIL PROTECTED]> wrote:
> On Feb 22, 2008, at 8:29 AM, Michael.Abshoff 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?
>
> http://sage.
Hello Sage-Devel,
Here's some fan mail thanking us for Sage. Keep up the good work!
-- Forwarded message --
From: ben taylor <>
Date: Fri, Feb 22, 2008 at 11:49 AM
Subject: Thank you for SAGE! I love it!
To: [EMAIL PROTECTED]
I am a chemical engineering master's student at the
On Feb 22, 8:52 pm, David Harvey <[EMAIL PROTECTED]> wrote:
> On Feb 22, 2008, at 2:43 PM, mabshoff wrote:
>
> > Hi David,
Hi David,
> > I poked around in the install log and the issue is "Resource
> > temporarily unavailable", i.e. the dreaded OSX resource limits that
> > are too low. A sugge
[EMAIL PROTECTED] wrote:
> I've found a nice implementation of the DLX algorithm, which "quickly" solves
> the NP-Complete exact cover problem. For those who aren't in Seattle and
> haven't heard me blathering on and on and on and on about how awesome DLX
> is...
>
> Let M be a binary matrix.
On Feb 22, 2008, at 2:43 PM, mabshoff wrote:
> Hi David,
>
> I poked around in the install log and the issue is "Resource
> temporarily unavailable", i.e. the dreaded OSX resource limits that
> are too low. A suggested fix is at
>
> http://wiki.sagemath.org/Tips
Thanks, well spotted!
> So: no
I've found a nice implementation of the DLX algorithm, which "quickly" solves
the NP-Complete exact cover problem. For those who aren't in Seattle and
haven't heard me blathering on and on and on and on about how awesome DLX is...
Let M be a binary matrix. An exact cover is a subset of the ro
On Fri, Feb 22, 2008 at 12:56 PM, David Joyner <[EMAIL PROTECTED]> wrote:
>
> On Fri, Feb 22, 2008 at 1:09 PM, Jason Grout
> <[EMAIL PROTECTED]> wrote:
> >
...
> >
> > Over on sage-edu, we ought to pretty quickly get a focus so that we
> > don't become too fragmented to do any good.
>
>
On Fri, Feb 22, 2008 at 12:04 PM, Jason Grout
<[EMAIL PROTECTED]> wrote:
>
> [EMAIL PROTECTED] wrote:
> > I've found a nice implementation of the DLX algorithm, which "quickly"
> solves the NP-Complete exact cover problem. For those who aren't in Seattle
> and haven't heard me blathering on a
On Feb 22, 2008, at 3:49 PM, William Stein wrote:
>
> On Fri, Feb 22, 2008 at 12:04 PM, Jason Grout
> <[EMAIL PROTECTED]> wrote:
>>
>> [EMAIL PROTECTED] wrote:
>>> I've found a nice implementation of the DLX algorithm, which
>>> "quickly" solves the NP-Complete exact cover problem. For those
The original problem said "binary matrix" so surely that means mod 2?
And I would expect mod 2 matrices to come up in the graph theory
applications. Not that I know about that...
John
On 22/02/2008, William Stein <[EMAIL PROTECTED]> wrote:
>
> On Fri, Feb 22, 2008 at 12:50 PM, David Harvey
>
In this context I think that binary means all the entries are 1s and zeros.
But when you look for a set of rows that add up to [1,1,1,...], you don't
consider 1+1=0. This makes sense when you want only one 1 to appear in each
column, which is a natural requirement, and makes the problem much harde
On Fri, Feb 22, 2008 at 12:50 PM, David Harvey
<[EMAIL PROTECTED]> wrote:
>
>
> On Feb 22, 2008, at 3:49 PM, William Stein wrote:
>
> >
> > On Fri, Feb 22, 2008 at 12:04 PM, Jason Grout
> > <[EMAIL PROTECTED]> wrote:
> >>
> >> [EMAIL PROTECTED] wrote:
> >>> I've found a nice implementation
Just a technical note: Mod 2 matrices are not the natural way to think
about adjacency matrices (I learned this the hard way) - the entry is
actually better thought of as the number of paths of length one from
one vertex to another. That way taking nth powers of the matrices
counts the number of n
Built ok (kubuntu 7.70, gcc version 4.1.3 20070929 (prerelease)
(Ubuntu 4.1.2-16ubuntu2))
The following tests failed:
sage -t devel/sage-main/sage/rings/number_field/number_field.py
sage -t devel/sage-main/sage/rings/number_field/number_field_ideal.py
Total time for all tests
On Feb 22, 11:20 pm, "John Cremona" <[EMAIL PROTECTED]> wrote:
> Built ok (kubuntu 7.70, gcc version 4.1.3 20070929 (prerelease)
> (Ubuntu 4.1.2-16ubuntu2))
Hi John,
> The following tests failed:
>
> sage -t devel/sage-main/sage/rings/number_field/number_field.py
> sage -t de
Done.
On 22/02/2008, mabshoff <[EMAIL PROTECTED]> wrote:
>
>
>
> On Feb 22, 11:20 pm, "John Cremona" <[EMAIL PROTECTED]> wrote:
> > Built ok (kubuntu 7.70, gcc version 4.1.3 20070929 (prerelease)
> > (Ubuntu 4.1.2-16ubuntu2))
>
>
> Hi John,
>
>
> > The following tests failed:
> >
> >
The following Mathematica options for the Plot function are
unsupported in Sage: AxesLabel, AxesOrigin, AxesStyle,
BaselinePosition, ClippingStyle, ColorFunction, ColorFunctionScaling,
EvaluationMonitor, Exclusions, ExclusionsStyle, Filling, FillingStyle,
MaxRecursion, Mesh, MeshFunctions, MeshSha
On Fri, Feb 22, 2008 at 10:56 AM, David Joyner <[EMAIL PROTECTED]> wrote:
>
> On Fri, Feb 22, 2008 at 1:09 PM, Jason Grout
> <[EMAIL PROTECTED]> wrote:
> >
> > Wow, this discussion blew up way to fast for me to keep on top of it
> and
> > form a coherent opinion. Ted, I'm specifically CCing you
Thanks Timothy!
I hope that people interested in 2d plotting can maybe think about some
of the things Mathematica does that Sage doesn't (listed below), and whether
Sage _should_ do them, and if so, what shape they should take in Sage,
then respond to this thread.
Thanks,
-- William
On Fri, F
On Fri, Feb 22, 2008 at 2:58 PM, William Stein <[EMAIL PROTECTED]> wrote:
> Thanks Timothy!
>
> I hope that people interested in 2d plotting can maybe think about some
> of the things Mathematica does that Sage doesn't (listed below), and
> whether
> Sage _should_ do them, and if so, what shape th
If it is an NP-complete problem, presumably it asks whether such a set
of rows exists, not that you find one.
Bill.
On 22 Feb, 21:32, Robert Miller <[EMAIL PROTECTED]> wrote:
> Just a technical note: Mod 2 matrices are not the natural way to think
> about adjacency matrices (I learned this the h
This accidentally went off list.
On Fri, Feb 22, 2008 at 3:42 PM, alex clemesha <[EMAIL PROTECTED]> wrote:
>
>
>
> On Fri, Feb 22, 2008 at 3:28 PM, William Stein <[EMAIL PROTECTED]> wrote:
> >
> > On Fri, Feb 22, 2008 at 3:10 PM, alex clemesha <[EMAIL PROTECTED]> wrote:
> > >
> > >
> > >
> > > On
Hi,
This is to announce the first "Sage Developer Coding Week 1":
http://wiki.sagemath.org/dev1
This will be like a Sage days, but it will be 100% aimed squarely
at Sage development and writing code. All talks will be directly
related to the coding projects.
--
ORGANIZERS: W
I jumped over from the sage-support group, where I had posted a
question about graphing x^(1/3). Alex Ghitza's response to me made
more sense when I read the background discussion here.
I am experiencing the same inconsistency revealed in the latter part
of this discussion. I am also running Sa
Great thanks are due to Jason G. for starting to distill some of the
issues involved in the developments leading to sage-edu in a very
gracious manner. I hope to add, in a similar vein (nothing about APIs,
sorry!), more commentary on some more of the underlying issues, and a
request to the "main d
Hello folks,
Sage 2.10.2 has been released on February 23nd, 2008. It is available at
http://sagemath.org/download.html
* About Sage (http://www.sagemath.org)
Sage is developed by volunteers and combines 71 open source packages.
It is available for download from sagemath.org and its
On Feb 23, 3:38 am, kcrisman <[EMAIL PROTECTED]> wrote:
Hi,
Du to lack of time and need for sleep I will only touch a couple
issue.
> Great thanks are due to Jason G. for starting to distill some of the
> issues involved in the developments leading to sage-edu in a very
> gracious manner. I h
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
The link for Mazur's paper "Finding meaning in error terms" is currently
http://www.ams.org/bull/-000-00/S0273-0979-08-01207-X/home.html
but it should be
http://www.ams.org/bull/2008-45-02/S0273-0979-08-01207-X/home.html
Best,
Alex
- --
44 matches
Mail list logo
