Hi Franco, Sebastien and others,
I'm correcting the patch about Interval Exchange Transformations (iet)
which uses a lot sage.iet.words.* (alphabet, words and morphisms). Just
some remarks about this nice library.
1) alphabet does not have a union procedure but... Alphabet heritates
from
On Dec 12, 12:42 am, Minh Nguyen nguyenmi...@gmail.com wrote:
FYI (Harald?), 4.1.1 and 4.1.2 are in the wrong order on that list.
It looks like the script
orders source tarballs according to dates.
Yes, and the only way to correct this is using touch to modify the
dates ;)
h
--
To post to
I just saw this on Slashdot:
http://news.slashdot.org/story/09/12/12/0457241/White-House-Plans-Open-Access-For-Research?art_pos=1.
Basically, as I understand it, NIH (National Institute of Health) funds
a huge amount of medical research, and all research funded by them is
required to be
Hi!
At several occasions in the last couple of days, I was bitten by
oddities and bugs in the conversion of multivariate polynomial rings.
Sure enough, if there is a coercion then conversion should be fine,
and I didn't find an error in this case.
However, what should happen if there is no
But what about the inconsistency in the first two examples?
For Infinite Polynomial Rings, I always need conversion *by names*. Is
there a conversion command (for MPolynomialRing_libsingular, at least)
that always behaves exactly like imap (and is as fast as imap, too)?
It should always
Hello,
First of all I have to say that I'm newbie with Sage. And I read that
it's a good idea to start a disscusion here in order to implement new
functionalities in Sage.
I'm working with the implementation of the Golay codes, in particular
for the binary Golays (G23 and G24). I have made a new
P.S. In fact * should means to ask for a retransmission of the word.
Gerard Bosch.
2009/12/12 Gerard Bosch gerard.bo...@gmail.com:
Hello,
First of all I have to say that I'm newbie with Sage. And I read that
it's a good idea to start a disscusion here in order to implement new
2009/12/12 Alex Ghitza aghi...@gmail.com:
On Fri, Dec 11, 2009 at 10:42:15PM +, John Cremona wrote:
OK, I have just built and started testing 4.3.rc0 on my 32-bit laptop,
so I'll see if the same happens there, That will be with Sage's own
gfortran; the test failures were when I built
On Sat, Dec 12, 2009 at 10:35 AM, Gerard Bosch gerard.bo...@gmail.com wrote:
Hello,
First of all I have to say that I'm newbie with Sage. And I read that
it's a good idea to start a disscusion here in order to implement new
functionalities in Sage.
I'm working with the implementation of the
Hi Martin!
On 12 Dez., 16:00, Martin Albrecht m...@informatik.uni-bremen.de
wrote:
[...]
It should always map *by names* and not by index IMHO.
It isn't that easy, I think.
One very important requirements is: If there is coercion then
conversion should yield the same result.
So, if there is
On Sat, 12 Dec 2009 16:04:21 +
John Cremona john.crem...@gmail.com wrote:
2009/12/12 Alex Ghitza aghi...@gmail.com:
On Fri, Dec 11, 2009 at 10:42:15PM +, John Cremona wrote:
OK, I have just built and started testing 4.3.rc0 on my 32-bit
laptop, so I'll see if the same happens
Instead, my questions are:
1. Can you please fix #7654?
I will take a look.
2. Is there a wrapper for singular's imap?
Almost, I am CCing [libsingular-devel] maybe someone there can immediately
make sense of the error message below (marked with ):
sage: P.x,y,z,a,b,c = QQ[]
sage: f =
PS:
On 12 Dez., 19:07, Simon King simon.k...@nuigalway.ie wrote:
[...]
So, I don't suggest that conversion should always attempt to be name
preserving.
But 'fetch' can't be the final answer either.
Here, we have to keep in mind that the coercion system wants to use
pushout. Imagine:
sage:
Hi Martin!
On 12 Dez., 19:18, Martin Albrecht m...@informatik.uni-bremen.de
wrote:
Instead, my questions are:
1. Can you please fix #7654?
I will take a look.
Than you!
2. Is there a wrapper for singular's imap?
Almost, I am CCing [libsingular-devel] maybe someone there can
The procedure I have implemented works faster because is an specific
decoder for the Golay codes and it's based on the syndrome computation
( s(v) = v*H^t, where H is the check_mat ). I think that the
syndrome implemented in (coding/decoder.py) it's not a real syndrome
decoding. It consists in
Yep,
the attached logfile does contain the lines:
***
Found Fink in /sw/bin/fink
*
Found either MacPorts or Fink in your PATH, which potentially wrecks
the Sage build process.
You should
Hi Martin, and probably hi Michael B., too!
I had a look at the code of SingularFunction in sage/libs/singular/
function.pyx, and it seems to me that it is impossible to use it for
imap or fetch.
Namely, it first tests if the arguments belong to a common ring, and
(if the optional argument
Namely, it first tests if the arguments belong to a common ring, and
(if the optional argument 'ring' is given) whether this is the given
ring. However, the whole point of fetch and imap is that there are
*different* rings involved, and thus it can't work here.
Or did I misunderstand?
Yes,
On Sat, 12 Dec 2009 19:12:38 +0100
Burcin Erocal bur...@erocal.org wrote:
I can also reproduce this, on a 32-bit Debian Lenny box, after setting
SAGE_FORTRAN to /usr/bin/gfortran and rebuilding from scratch.
On a build without the problem:
sage: Q.i = NumberField(x^2+1)
sage: complex(i)
On Dec 12, 2009, at 1:40 PM, Burcin Erocal wrote:
On Sat, 12 Dec 2009 19:12:38 +0100
Burcin Erocal bur...@erocal.org wrote:
I can also reproduce this, on a 32-bit Debian Lenny box, after
setting
SAGE_FORTRAN to /usr/bin/gfortran and rebuilding from scratch.
On a build without the
On 12/10/09, William Stein wst...@gmail.com wrote:
2. The user reports that maxima reads the file
local/lib/ecl-9.10.2/sysfun.lsp one character at a time doing 72K
read() calls of one
character each. The sys admin doubts that is anywhere near the
problem of the NFS stat calls, but it does
Streams may be opened with either ANSI C streams (fopen) or with C file
descriptors (open). The later is needed for sockets and certain devices,
while the formers provide buffering and may be better in some systems.
That's all. The difference is that ECL did not allow C file descriptors to
be used
Hi folks,
I have written a draft of a tutorial on functional programming for
mathematicians. The tutorial is available on the Sage wiki [1], but
you could also find it at Wordpress [2]. This is a redundancy measure
in case the wiki is down. I invite you to comments on it or expand it
as
On Sat, Dec 12, 2009 at 7:02 PM, Minh Nguyen nguyenmi...@gmail.com wrote:
Hi folks,
I have written a draft of a tutorial on functional programming for
mathematicians. The tutorial is available on the Sage wiki [1], but
you could also find it at Wordpress [2]. This is a redundancy measure
in
Minh Nguyen wrote:
Hi folks,
I have written a draft of a tutorial on functional programming for
mathematicians. The tutorial is available on the Sage wiki [1], but
you could also find it at Wordpress [2]. This is a redundancy measure
in case the wiki is down. I invite you to comments on it
Hi,
The developer guide says that any single doctest shouldn't take more
than around 30 seconds. This is of course highly machine-dependent,
but I assume we can take sage.math as a reference point.
There are a handful of files in the Sage library that account for a
large amount of the time
On Dec 12, 4:24 pm, Jason Grout jason-s...@creativetrax.com wrote:
[f(x) for x in [1..10] if f(x)0]
This is actually bad style. It means that f gets evaluated twice for
all the values that end up in the list.
The magma language solves this with modified semantics for the where
clause. One would
Nils Bruin wrote:
On Dec 12, 4:24 pm, Jason Grout jason-s...@creativetrax.com wrote:
[f(x) for x in [1..10] if f(x)0]
This is actually bad style. It means that f gets evaluated twice for
all the values that end up in the list.
Good point.
The magma language solves this with modified
On Sun, 13 Dec 2009 at 11:02AM +1100, Minh Nguyen wrote:
I have written a draft of a tutorial on functional programming for
mathematicians.
I'd recommend linking to or citing an article in the Monthly -- I think
it was called Unbounded spigot algorithms for digits of pi, from maybe
2004 or
Hi David,
On Sun, Dec 13, 2009 at 11:20 AM, David Joyner wdjoy...@gmail.com wrote:
SNIP
I think this would fit nicely in the constructions document.
Adding an example of how to use map for Sage matrices might
be worth thinking about.
I have provided some examples on using lambda and map()
Hi Jason,
On Sun, Dec 13, 2009 at 11:24 AM, Jason Grout
jason-s...@creativetrax.com wrote:
SNIP
Do you think you could add a sentence or two in the filter section about
using list comprehensions to do filters, like you did above in the map
section?
The tutorial is updated with such an
Hi Dan,
On Sun, Dec 13, 2009 at 1:59 PM, Dan Drake dr...@kaist.edu wrote:
SNIP
I'd recommend linking to or citing an article in the Monthly
Done. The conclusion part of the tutorial now links to Gibbons' AMM article.
--
Regards
Minh Van Nguyen
--
To post to this group, send an email to
32 matches
Mail list logo
