Hello all,
I was a bit surprised to find out just how lazy LazyFamily is:
sage: f = Family(Zmod(3), lambda i: 2*i) # This will be lazy by default
sage: f[2] # I think this should be 1
4
sage: f['spam'] # I think this should fail
'spamspam'
Compare with:
sage: f = Family([i for i in Zmod(3)],
There is a homomorphism of the coroot lattice into the affine
Weyl group.
At least in principle, this can be computed by taking a fundamental
alcove F and translating it by an element d of the coroot lattice,
then
seeing what alcoves lie between F and F+d. It seems to me that
it would be
It looks like the algorithm I asked for in my previous message is in
the patch reduced_word_of_translations_nt.patch which is in the
combinat queue.
What are the prospects for getting this into Sage? Making a
trac ticket for it?
Dan
--
You received this message because you are subscribed to
sorry this got stuck in my drafts folder!
it is probably too late now, but see below for my reply
On Sun, Apr 18, 2010 at 11:11 AM, Nicolas M. Thiery
nicolas.thi...@u-psud.fr wrote:
Dear Nathann, dear David Joyner,
On Sun, Apr 18, 2010 at 04:54:07PM +0200, Nathann Cohen wrote:
The
Hi Tom!
On Thu, Apr 15, 2010 at 04:34:42PM -0700, Tom Boothby wrote:
I must confess that I wasn't really convinced by my suggestion of using
... Again, I don't like this
name but I'm arguing that I even more dislike plain_changer.
Fair enough, and well argued. I believe Knuth
On Wed, Apr 28, 2010 at 10:35:24AM -0700, bump wrote:
It looks like the algorithm I asked for in my previous message is in
the patch reduced_word_of_translations_nt.patch which is in the
combinat queue.
What are the prospects for getting this into Sage? Making a
trac ticket for it?
As far
On Tue, Apr 27, 2010 at 06:34:02PM +0200, Martin Rubey wrote:
sage: version()
'Sage Version 4.3.3, Release Date: 2010-02-21'
Hmm, I would have expected for this to work, though I did not try
recently. Your best bet is to install Sage 4.3.4.
(thanks :-)
Welcome!
BTW: plotting works
On Wed, Apr 28, 2010 at 03:40:20PM -0700, Anne Schilling wrote:
Dear Dan and Nicolas,
Yes, this is the patch that does it! And I will need this as well
for the type-free implementation of the affine Stanley symmetric
functions to be presented next week at the Sage Days in Toronto.
Nicolas (et al),
Thanks for your comments! Unfortunately, you replied minutes after I
put up a new patch. The class (which I named PermutationEnumerator
because nobody else had piped up) is purely for reference, and I don't
actually see any other benefit to including it: it duplicates
The patch applies without any problems to Sage 4.4.
I have one concern which is that the relevant lattice
is the coroot lattice and (for the extended affine Weyl
group) the coweight lattice.
In the example, we have this:
We start by translations by elements of the coroot lattice::
Shouldn't we be working with the fundamental coweights, not the
fundamental weights?
In this example it makes no difference since the root system is
simply-laced.
Dan
I didn't quote enough of the context in weight_lattice_realization
to show what I mean.
sage: R =
Hi!
Has there recently been a change in the subgraph method?
The following code currently break (which did not break before).
Thanks,
Anne
sage: DynkinDiagram(['C',3,1]).subgraph([1])
---
TypeError
On Apr 27, 9:58 pm, Minh Nguyen nguyenmi...@gmail.com wrote:
Hi folks,
I have wrapped up a t2.math binary of Sage 4.4. You can find it under
http://sage.math.washington.edu/home/mvngu/t2.math-bin/
There is also a somewhat smaller one in
http://sage.math.washington.edu/home/release/sage-4.4/
mwrank.pyx is #8799
We probably do not need to announce all these on sage-devel...
John
On 28 April 2010 06:10, Robert Bradshaw rober...@math.washington.edu wrote:
On Apr 27, 2010, at 9:13 PM, William Stein wrote:
Hi Sage-Devel,
One of the goals for Sage-5.0 is 90% doctest coverage. We
categories is #8800 - and extending doc tests, I immediately found a
bug...
On Apr 28, 9:12 am, John Cremona john.crem...@gmail.com wrote:
mwrank.pyx is #8799
We probably do not need to announce all these on sage-devel...
I searched for categories doctest before creating the ticket. But I
This might be of interest:
from the people of MPFR,
Mpfrcx is a library for the arithmetic of univariate polynomials over
arbitrary precision real (Mpfr) or complex (Mpc) numbers, without
control on the rounding. For the time being, only the few functions
needed to implement the floating point
On Apr 28, 4:50 am, Simon King simon.k...@nuigalway.ie wrote:
categories is #8800 - and extending doc tests, I immediately found a
bug...
On Apr 28, 9:12 am, John Cremona john.crem...@gmail.com wrote:
mwrank.pyx is #8799
We probably do not need to announce all these on sage-devel...
On 04/27/2010 11:13 PM, William Stein wrote:
Hi Sage-Devel,
One of the goals for Sage-5.0 is 90% doctest coverage. We need about
1500 new tests to get written to reach this goal.
real_mpfi.pyx: 72% (85 of 117)
real_mpfr.pyx: 75% (126 of 168)
#7682 has lots of doctests for these files
A very nice looking library, but it uses Karatsuba and Toom Cook, the
very things we decided we unstable. I also read that the Rader-Brenner
FFT is very unstable.
Bill.
On Apr 28, 2:14 pm, YannLC yannlaiglecha...@gmail.com wrote:
This might be of interest:
from the people of MPFR,
Mpfrcx is
OK, the reason the Rader-Brenner FFT is unstable is it uses purely
imaginary twiddle factors with absolute value significantly greater
than 1 when n is large. This causes instability.
There are apparently other FFT's which use less real multiplications
and are much better behaved.
Bill.
On Apr
Rader-Brenner is less stable because it uses purely imaginary twiddle
factors whose absolute value is considerably bigger than 1. It has
been largely discarded in favour of the split-radix method which uses
less real multiplications and additions anyhow.
It's very interesting to see an
sorry this got stuck in my drafts folder!
it is probably too late now, but see below for my reply
On Sun, Apr 18, 2010 at 11:11 AM, Nicolas M. Thiery
nicolas.thi...@u-psud.fr wrote:
Dear Nathann, dear David Joyner,
On Sun, Apr 18, 2010 at 04:54:07PM +0200, Nathann Cohen wrote:
The
I coded up a basic classical multiplication (no attempt whatsoever to
prevent cancellation). Fortunately the result of the classical and
Hartley multiplication routines agree (up to some precision loss).
I picked on the timings Robert gave:
sage: f = (x+1)^1000
sage: timeit(f*f)
5 loops, best of
Hi,
There are a *huge* number of tickets needing review:
http://trac.sagemath.org/sage_trac/report/30
Since there is a fresh new sage-4.4 out, now is a good time to do a
few reviews. The above list is handily sorted by component.
And thanks for all the work resulting from my doctest email.
Hello:
Tracking a weird bug I've discovered the following:
For a symbolic variable x and a numpy.float64 y, the code 'xy' evals
to a Symbolic expression, while 'yx' evals to a numpy.bool.
I'm afraid I'm stacked, as it is the responsability of the method
numpy.float64.__lt__, and I can't
My mind slipped: I meant Symbolic expression involving numpy.float
--
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 group at
Hi all,
Sage-4.4 cdrom can be download from:
http://diffusion.cgu.edu.tw/ftp/sage-4.4.iso
It bases on slax-6.2 version, Slakware Linux, and includes TeXmacs
too.
cch
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
Thanks!!
On Wed, Apr 28, 2010 at 10:34 PM, cch cchu...@mail.cgu.edu.tw wrote:
Hi all,
Sage-4.4 cdrom can be download from:
http://diffusion.cgu.edu.tw/ftp/sage-4.4.iso
It bases on slax-6.2 version, Slakware Linux, and includes TeXmacs
too.
cch
--
To post to this group, send an email
Hi,
On Thu, Apr 29, 2010 at 3:34 PM, cch cchu...@mail.cgu.edu.tw wrote:
Hi all,
Sage-4.4 cdrom can be download from:
http://diffusion.cgu.edu.tw/ftp/sage-4.4.iso
This is too good to stay in sage-devel. I have also announced it on
the Sage Math Facebook forum:
29 matches
Mail list logo
