On Sat, Feb 23, 2008 at 10:24 AM, William Stein <[EMAIL PROTECTED]> wrote:
>
> On Sat, Feb 23, 2008 at 9:39 AM, alex clemesha <[EMAIL PROTECTED]> wrote:
> >
> >
> >
> > On Sat, Feb 23, 2008 at 12:02 AM, didier deshommes <[EMAIL PROTECTED]>
> > wrote:
> > >
> > >
> > > On Fri, Feb 22, 2008 at 5:57
Hi all,
just a minor fix in the description.
Cheers!
-
Sirio Bolaños.
UNAM, México.
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For mor
Hi again,
I've just added some description so it show when typing isolve?
Cheers.
Sirio Bolaños.
UNAM, México.
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send
Hi everyone:
I've made a little function for solving inequalities, it hasn't been
extensively tested but it works at least for solving both of Wester's
problems on inequalities and some my girlfriend had a few days ago.
Hope you find it useful.
Cheers.
--
Sirio Bolaños.
UNAM, Mé
On Sat, Feb 23, 2008 at 3:16 PM, John Cremona <[EMAIL PROTECTED]> wrote:
>
> That's the same Suse version as mine:
And coincidentally I don't test building Sage under SUSE.
I did for a long time, but then ran into a bug in their compilers,
and couldn't figure out how to install new compilers sin
What a coincidence. One of the algorithms discussed by that paper is
by Cocks; and I heard Cocks give a lecture about it last Monday (he
just received an honorary degree from the University of Bristol where
I am visiting, as those of you who were at SD6 know). And both the
paper and Cocks in hi
That's the same Suse version as mine:
[EMAIL PROTECTED] /etc/issue
Welcome to openSUSE 10.2 (X86-64) - Kernel \r (\l).
Each of the 4 processors is like this:
processor : 3
vendor_id : AuthenticAMD
cpu family : 15
model : 65
model name : Dual-Core AMD Opteron(tm)
A friend of mine also pointed out the following, which uses Sage to compare
runtimes for different algorithms:
Dan Boneh, Craig Gentry, Michael Hamburg. http://crypto.stanford.edu/~dabo/pubs.html";>Space-efficient identity based
encryption without pairings (37 pages), Proceedings FOCS 2007.
David
Dear Sage team,
totallyreal.py failed for me as well.
I was building from scratch. My "coordinates":
> uname -a
Linux mpc739 2.6.18.8-0.3-default #1 SMP Tue Apr 17 08:42:35 UTC 2007
x86_64 x86_64 x86_64 GNU/Linux
> cat /etc/issue
Welcome to openSUSE 10.2 (X86-64) - Kernel \r (\l).
> gcc -v
E
On Sat, Feb 23, 2008 at 12:46 PM, <[EMAIL PROTECTED]> wrote:
>
>
>
>
> On Sat, 23 Feb 2008, Carlo Hamalainen wrote:
>
> >
> > On Fri, Feb 22, 2008 at 8:55 PM, <[EMAIL PROTECTED]> wrote:
> >> Arguments for including Ajanki's code:
> >> 1) It's the only Python implementation of DLX I've
The following code is fine if 10^17 is replaced by (say) 10^16, so the
underlying cause is probably due to being close to pari's limitations.
But the error message is rather unacceptable! Here gp is yielding an
error message (see end)
[EMAIL PROTECTED]
--
On Sat, 23 Feb 2008, Carlo Hamalainen wrote:
>
> On Fri, Feb 22, 2008 at 8:55 PM, <[EMAIL PROTECTED]> wrote:
>> Arguments for including Ajanki's code:
>> 1) It's the only Python implementation of DLX I've seen.
>> 2) I emailed the author, who happily added the "or later" bit after th
I did not interpret the response as dismissive! The OS and compiler
details are posted on trac 2279. (64-bit Suse, gcc 4.1.2).
John
On 23/02/2008, mabshoff <[EMAIL PROTECTED]> wrote:
>
>
>
> On Feb 23, 8:03 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
>
> > On Sat, Feb 23, 2008 at 10:55 AM,
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi folks,
I made a first attempt at a bibtex() function for citing Sage
components. It returns a string containing either the citation
information in bibtex database format (i.e. what you would put in a .bib
file) or in bibliography format (i.e. what
I am having trouble as described in trac # 2003; I had the same
problem with 2.10.1 but I don't have a serious reason to use the
latest sage on my laptop, so I just waited and hoped it would get
fixed for 2.10.2.
I tried changing my path to something pretty minimal but I am still
having this prob
okay I made a list of all diff() and derivative() and
differentiate() functions that we should probably be caring about for
this issue. The list does not include aliases.
functions/elementary.py
class ElementaryFunction_class(CommutativeRingElement):
def differentiate(self,
On Sat, Feb 23, 2008 at 11:07 AM, mabshoff <[EMAIL PROTECTED]> wrote:
>
>
>
> On Feb 23, 8:03 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
>
>
> > On Sat, Feb 23, 2008 at 10:55 AM, John Cremona <[EMAIL PROTECTED]> wrote:
> >
> > > A fresh 64-bit install of 2.10.2 have this (and only this) er
On Fri, Feb 22, 2008 at 8:55 PM, <[EMAIL PROTECTED]> wrote:
> Arguments for including Ajanki's code:
> 1) It's the only Python implementation of DLX I've seen.
> 2) I emailed the author, who happily added the "or later" bit after the
> GPL2
> 3) With my Sage Matrix -> DLXMatrix code
On Feb 23, 8:03 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Sat, Feb 23, 2008 at 10:55 AM, John Cremona <[EMAIL PROTECTED]> wrote:
>
> > A fresh 64-bit install of 2.10.2 have this (and only this) error with
> > "make check":
>
> > sage -t
> > devel/sage-main/sage/rings/number_field/
On Sat, Feb 23, 2008 at 10:55 AM, John Cremona <[EMAIL PROTECTED]> wrote:
>
> A fresh 64-bit install of 2.10.2 have this (and only this) error with
> "make check":
>
> sage -t
> devel/sage-main/sage/rings/number_field/totallyreal.py*
A fresh 64-bit install of 2.10.2 have this (and only this) error with
"make check":
sage -t
devel/sage-main/sage/rings/number_field/totallyreal.py**
File "totallyreal.py", line 410:
sage: sage.rings.number_field.totallyreal
On Sat, Feb 23, 2008 at 9:39 AM, alex clemesha <[EMAIL PROTECTED]> wrote:
>
>
>
> On Sat, Feb 23, 2008 at 12:02 AM, didier deshommes <[EMAIL PROTECTED]>
> wrote:
> >
> >
> > On Fri, Feb 22, 2008 at 5:57 PM, alex clemesha <[EMAIL PROTECTED]> wrote:
> > > In Knoboo we *decouple* the idea of a kernel
On Sat, Feb 23, 2008 at 11:26 AM, mabshoff <[EMAIL PROTECTED]> wrote:
...
> it always takes a while (roughly up to a day) for the binaries to be
> build, tested and uploaded to the sagemath.org. So they should appear
> this evening.
>
> Cheers,
>
> Michael
I see. Thanks for letting me know,
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
I was going to point to trac tickets and comments by David Harvey, but
he beat me to the punch :)
Since I agree with what he already said, I'll just address one point:
Carl Witty wrote:
| 1) Do we really need three names for this concept? Could we
On Feb 23, 2008, at 1:03 PM, Carl Witty wrote:
> Currently, symbolic expressions have 3 identical "derivative"
> methods: .derivative(), .diff(), and .differentiate() (that is, they
> are aliases of each other). These have a powerful argument list;
> foo.diff(x, 3, y, z, 2) differentiates three
Currently, symbolic expressions have 3 identical "derivative"
methods: .derivative(), .diff(), and .differentiate() (that is, they
are aliases of each other). These have a powerful argument list;
foo.diff(x, 3, y, z, 2) differentiates three times with respect to x,
then once with respect to y, th
On Sat, Feb 23, 2008 at 12:02 AM, didier deshommes <[EMAIL PROTECTED]>
wrote:
>
> On Fri, Feb 22, 2008 at 5:57 PM, alex clemesha <[EMAIL PROTECTED]> wrote:
> > In Knoboo we *decouple* the idea of a kernel, it could be another
> > Python (Sage) process, with communication through Pexpect
> >
> > ..
Hi Hector,
> I just noticed that the binary downloads for sage-2.10.2 haven't been
> updated, just the source code is available.
> Best,
> --
> Hector
it always takes a while (roughly up to a day) for the binaries to be
build, tested and uploaded to the sagemath.org. So they should appear
this
On Sat, Feb 23, 2008 at 10:17 AM, William Stein <[EMAIL PROTECTED]> wrote:
>
> On Sat, Feb 23, 2008 at 7:21 AM, mabshoff <[EMAIL PROTECTED]> wrote:
> >
> >
> >
> > On Feb 23, 3:48 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> > > Hello folks,
> > >
> > > Sage 2.10.2 has been release
On Sat, Feb 23, 2008 at 7:21 AM, mabshoff <[EMAIL PROTECTED]> wrote:
>
>
>
> On Feb 23, 3:48 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> > Hello folks,
> >
> > Sage 2.10.2 has been released on February 23nd, 2008. It is available at
> >
> >http://sagemath.org/download.html
>
On Feb 23, 2008, at 10:33 AM, Alex Ghitza wrote:
> David Harvey, http://arxiv.org/abs/0708.3404";>Efficient
> computation of p-adic heights (18 pages), 2007.
This will appear soon in LMS JCM.
http://www.lms.ac.uk/jcm/
> David Harvey, http://arxiv.org/abs/math/0610973";>Kedlaya's
> algorithm in
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Patrick Ingram, http://arxiv.org/abs/0802.2651";>Multiples of
integral points on elliptic curves (29 pages), 2008.
Nicholas J. Cavenagh, Carlo Hamalainen, Adrian M. Nelson, http://arxiv.org/abs/0712.0233";>On completing three cyclic
transversals to
On Feb 23, 3:48 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> Hello folks,
>
> Sage 2.10.2 has been released on February 23nd, 2008. It is available at
>
>http://sagemath.org/download.html
Those of you who want to bundle patches against 2.10.2 be warned that
currently the repo a
I think, though I'm not sure, that mabshoff has perhaps misunderstood
my points, probably because my post was too long, for which I
apologize. As I said, this post was very much in the conciliatory
spirit of Jason Grout's original one. In particular, I was
emphatically not addressing any of the
If you want to carry out operations on the semiring afore mentioned,
where adding is OR (not XOR) and multiplying is AND, then you can
use floating point arithmetic.
Let Z be 0, and let P be "non-zero positive". Then ordinary
multiplication and addition have the following chart
ZZ=Z, ZP=Z, PP=P.
Excellent work.
I, too, have thought about DLX a lot. It is well known, being
recommended by Knuth, more than once, in the context of
people who need to solve NP-complete problems.
This is part of the general paradigm of solving NP-complete
problems, where you build up a library of very good
heu
On Fri, Feb 22, 2008 at 5:57 PM, alex clemesha <[EMAIL PROTECTED]> wrote:
> In Knoboo we *decouple* the idea of a kernel, it could be another
> Python (Sage) process, with communication through Pexpect
>
> ... but it also couple be another Python (Sage) process running a very
> minimal XML-RPC ser
37 matches
Mail list logo
