the archive gap3-jm4.tar.gz from
my homepage to do so...
--
Jean MICHEL, Groupes et representations, IMJ-PRG UMR7586 tel.(33)157279144
Bureau 639 Bat. Sophie Germain Case 7012 - 75205 PARIS Cedex 13
--
You received this message
:=CoxeterGroup(E,7);;
gap LeftCell(W,Random(W));time;
LeftCellE7: duflo=18,21,45,53 character=phi{378,14}
40
40 milliseconds!
Best regards,
--
Jean MICHEL, Groupes et representations, IMJ-PRG UMR7586 tel.(33)157279144
Bureau 639
)
(207,237,240) ] )
gap Size(R);
5806080
gap Size(N);
5806080
And it is the same as the centralizer of s_alpha1.
So you are looking for the coset of E7 described above
--
Jean MICHEL, Groupes et representations, IMJ-PRG
when concatenating paths that do not match.
Florent suggested to call it monoidoid.
I think Florent just invented a new name for 'category', or more exactly the
path algebra of a category.
--
Jean MICHEL, Groupes et
,
Jean MICHEL, Equipe des groupes finis, Institut de Mathematiques UMR7586
Bureau 9D17 tel.(33)157279144, 175, rue du Chevaleret 75013 Paris
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel
MICHEL, Equipe des groupes finis, Institut de Mathematiques UMR7586
Bureau 9D17 tel.(33)157279144, 175, rue du Chevaleret 75013 Paris
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post to this group, send email to sage-combinat-devel
without installing Maple.
Is that clear? Perhaps you would learn some interesting things for you by
browsing the current Chevie manual:
http://www.math.jussieu.fr/~jmichel/gap3/htm/index.htm
Jean MICHEL, Equipe des groupes
for the imprimitive groups.
You will find them in the next version of Chevie.
Best regards,
Jean MICHEL, Equipe des groupes finis, Institut de Mathematiques UMR7586
Bureau 9D17 tel.(33)157279144, 175, rue du Chevaleret 75013
this into the code as
well...
OK, this way you can check my assertions above...
Best regards,
Jean MICHEL, Equipe des groupes finis, Institut de Mathematiques UMR7586
Bureau 9D17 tel.(33)157279144, 175, rue du Chevaleret 75013 Paris
MICHEL, Equipe des groupes finis, Institut de Mathematiques UMR7586
Bureau 9D17 tel.(33)157279144, 175, rue du Chevaleret 75013 Paris
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post to this group, send email to sage-combinat-devel
!
Jean MICHEL, Equipe des groupes finis, Institut de Mathematiques UMR7586
Bureau 9D17 tel.(33)157279144, 175, rue du Chevaleret 75013 Paris
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post to this group, send email
).
Jean MICHEL, Equipe des groupes finis, Institut de Mathematiques UMR7586
Bureau 9D17 tel.(33)157279144, 175, rue du Chevaleret 75013 Paris
--
You received this message because you are subscribed to the Google Groups
sage-combinat
,
Jean MICHEL, Equipe des groupes finis, Institut de Mathematiques UMR7586
Bureau 9D17 tel.(33)157279144, 175, rue du Chevaleret 75013 Paris
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To post to this group, send
. Though Jean Michel might have
generalizations. Jean?
I received 3 messages, I do not know to which reply -- I choose this one.
All you want is implemented in Chevie, which is accessible via the GAP3
interface, so that's one solution. Note that Gordon and Griffeth that you
quote use Chevie
--
| Sage Version 4.2, Release Date: 2009-10-24 |
| Type notebook() for the GUI, and license() for information.|
--
sage: var(t a
This was on a freshly compiled Sage 4.2. I did not do anything
else in this session.
On Nov 25, 1:03 pm, Florent Hivert florent.hiv...@univ-rouen.fr
wrote:
On Wed, Nov 25, 2009 at 03:20:38AM -0800, Michel wrote:
--
| Sage
Too bad. I really need those determinants. Will
sage -upgrade
magically put things right for me?
I feel hesitant to spend another day compiling sage.
On Nov 25, 1:14 pm, Florent Hivert florent.hiv...@univ-rouen.fr
wrote:
[...]
This looks like an after-effect of ticket #6441. Sebastian
/
As far as I know there is no software to do mutations of graphs with
potentials (see http://arxiv.org/abs/0704.0649) so this would
be very useful to have in sage as well.
Michel
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel
of an
abelian category.
Regards,
Michel
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-devel-unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com
elements.
Regards,
Michel
On May 19, 4:50 pm, John H Palmieri jhpalmier...@gmail.com wrote:
On May 19, 2:25 am, Nicolas M. Thiery nicolas.thi...@u-psud.fr
wrote:
Hi John,
On Mon, May 18, 2009 at 09:25:56PM -0700, John H Palmieri wrote:
On May 18, 8:43 pm, wkehowski wkehow
For some reason the documentation in the reference manual
seems to be different from the documentation in the docstrings.
I think if the docstrings were sufficiently expanded then it should
be possible to extract the reference manual directly from the
docstrings.
Regards,
Michel
On May 18, 9
Fantastic. Thanks a lot!!!
I had never heard of this to_poly_solve function.
Regards,
Michel
On May 18, 7:05 pm, Mike Hansen mhan...@gmail.com wrote:
Hello Michel,
On Sat, May 16, 2009 at 2:59 AM, Michel michel.vandenbe...@uhasselt.be
wrote:
var('Q')
solve(Q*sqrt(Q^2 + 2) - 1,Q
One thing: the TEST section is not documented.
Michel
On May 16, 9:52 pm, Robert Bradshaw rober...@math.washington.edu
wrote:
On May 16, 2009, at 8:35 AM, Michel wrote:
On May 16, 1:10 pm, Robert Bradshaw rober...@math.washington.edu
wrote:
On May 16, 2009, at 3:16 AM, Michel wrote
var('Q')
solve(Q*sqrt(Q^2 + 2) - 1,Q)
yields
[Q == 1/sqrt(Q^2 + 2)]
Not what I was looking for!
Regards,
Michel
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-devel
Here is one thing I find difficult to use about sage: the help system.
When in my previous post the symbolic solve command failed on me I
wanted to use
a numeric solve command. So I did
solve?
Alas the help page that is returned does not contain a See also
section. So this didn't work.
So I
I did some more digging around and now I see that the section in
the reference manual on solve is actually more useful than
what is returned by solve?
(1) It is more concise.
(2) It actually contains a reference to find_root, a numerical
method for solving equations
Regards,
Michel
Dear Simon,
I am a fairly experienced python/sage user so I know what you wrote.
My point is that what that apparently solve is documented in
two ways
(1) as reply to solve?
(2) as a section in the reference manual
In this case the information obtained by method (2) is more concise
and useful
I always get
/home/sage/sage_install/sage-a/local/bin/sage-sage: line 348: 26501
Segmentation fault python $@
Connection to localhost closed.
when trying prime_pi on www.sagenb.org
Regards,
Michel
On May 5, 4:32 am, William Stein wst...@gmail.com wrote:
This is from the guy who wrote
I very much like the self organizing feature of the graphs on the
applets
on this page
http://people.math.jussieu.fr/~keller/quivermutation/
Don't forget to check Live Quiver.
It's like what GraphViz does but then in real time.
Regards,
Michel
I wonder if GraphViz is part of sage. I thought it was
specially designed for visualizing graphs.
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
That's too bad. I knew GraphViz was open source. I didn't know
they chose a GPL incompatible license.
Michel
On Apr 30, 6:06 pm, William Stein wst...@gmail.com wrote:
On Thu, Apr 30, 2009 at 9:02 AM, Michel michel.vandenbe...@uhasselt.be
wrote:
I wonder if GraphViz is part of sage. I
+1
I always wondered why this doesn't work. Forcing
me to remember the syntax for a numerical integral...
%maxima
integrate(sqrt(x^3+1),x,2,10), float
///
'integrate((x^3+1)^0.5,x,2,10)
It would be very nice to have this feature though!
-- William
I think so. But then you should be working in a ring of truncated
power series
(i.e. k[x]/(x^a)). This seems conceptually different from working
in a ring of power series where you only know the elements up to
a given precision
On Mar 14, 9:53 pm, John Cremona john.crem...@gmail.com wrote:
,
Michel
On Mar 9, 7:53 pm, Nicolas M. Thiery nicolas.thi...@u-psud.fr
wrote:
Dear Michel,
On Mon, Mar 09, 2009 at 12:03:34AM -0700, Michel wrote:
A long time ago I made a FractionFIeld implementation which would
cache factorizations of denominators. instead of taking gcd's all
Very nice. This something I always found confusing. One thing is not
clear to me:
why is sin not a callable symbolic expression by default? Is there a
coneptional
reason for this, or is it performance related?
On Mar 10, 8:07 am, William Stein wst...@gmail.com wrote:
On Mon, Mar 9, 2009 at 4:32
Hi Nicolas,
A long time ago I made a FractionFIeld implementation which would
cache factorizations of denominators. instead of taking gcd's all the
time
http://markmail.org/message/7hxox5cbz5knxjse#query:new%20implementation%20of%20fraction%20field+page:1+mid:5bf3l37bsim34m4g+state:results
It
Hi all,
Maybe it is time for Sage to drop its ban on GPL3 code?
After all there is the lawsuit of Microsoft against TomTom.
If Microsoft does not behave nicely with people using open source
software there is zero reason to be nice to them.
Michel
On Mar 5, 7:02 pm, Robert Bradshaw rober...@math.washington.edu
wrote:
On Mar 5, 2009, at 5:27 AM, Michel wrote:
Hi all,
Maybe it is time for Sage to drop its ban on GPL3 code?
This is a topic that we will certainly be revisiting in the future,
but I see no reason it is imperative
+1
The default factor command in sage is rather slow.
On Feb 19, 9:48 am, jeffblakeslee jeffb...@gmail.com wrote:
Hello all,
Please consider voting on the addition of msieve to sage. This
includes an interface file and an .spkg. Msieve, by Jason
Papadopoulos, should increase the
Hmm this question is going to have (too) many solutions:
Take any solution with 781-64 arbitrarily assigned zeros. Chances are
big
that this solution has at most 38 ones.
What if we replace 38 by a smaller number. Say 20?
Michel
On Nov 12, 8:43 am, Michel [EMAIL PROTECTED] wrote:
Hi,
I
If the equations are really linear, then it's trivial.
Ah, can you tell me more?
Regards,
Michel
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more
Thanks!
I will think about your suggestions.
I asked you since I know you are a cryptographer. I assume
cryptographers
know all about reversing hashes!
Of course the question was in fact addressed to the whole list.
Thanks again,
Michel
On Nov 12, 4:30 pm, Martin Albrecht [EMAIL PROTECTED
,
Michel
BTW I more or less know how this problem is attacked in characteristic
zero.
On Nov 12, 11:10 am, Michael Brickenstein [EMAIL PROTECTED] wrote:
http://m4ri.sagemath.org/performance.html
On 12 Nov., 11:07, Michel [EMAIL PROTECTED] wrote:
If the equations are really linear, then it's
specifically a so-called Zobrist hash
function which is widely used in chess engines.
Regards,
Michel
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options
that coercion to a complex
number happens for pi but not for I (even though zeta_symmetric
expect a complex number as input).
Michel
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL
An assumption framework is non-trivial as it is basically
computational
real algebraic geometry.
Recenty there was a post about QEPCAD (http://www.cs.usna.edu/~qepcad/
B/QEPCAD.html).
Perhaps this might fit the bill?
Michel
On Aug 26, 8:43 am, William Stein [EMAIL PROTECTED] wrote:
On Mon
I think log(2) is an element of the symbolic ring SR. There is no
canonical
morphism SR--RR. So perhaps coercion is not expected to work?
Michel
On May 31, 2:21 pm, Henryk Trappmann [EMAIL PROTECTED] wrote:
Hello,
while the general rule of coercing in binary operations seems to be
towards
For what it's worth, I prefer B.
Michel
On May 23, 3:17 pm, John Cremona [EMAIL PROTECTED] wrote:
I vote for Proposal B.
John
On May 21, 10:02 pm, Nick Alexander [EMAIL PROTECTED] wrote:
Wow! In that case I revise my viewpoint on this matter. That's
really interesting
) easy
and natural to use, (2) mathematically correct and complete.
One remark. The tensor product is only the coproduct in the category
of commutative rings. In the category rings the coproduct is the free
product but the tensor product still makes sense.
Michel
framework.
The advantage of having abstract derivations would be that one could
add them, take their
commutatior etc
Regards,
Michel
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send
and the origin.
That way you can speak about functions holomorphic at infinity etc...
Now we could also equip the complex plane with a circle at
infinity. This is the Stone Cech compactification.
I guess this is just not the right thing for complex analysis.
Michel
points at
infinity we need to specify
which compactification we use. In the case of the real line we have
the choice
of the the interval (-inf,+inf) and the circle (inf). The preferred
choice of compactification
depends on the context.
Michel
On Mar 28, 9:54 am, William Stein [EMAIL PROTECTED] wrote
There is also the affine package in maxima.
Regards,
Michel
On Dec 27, 5:46 am, Mike Hansen [EMAIL PROTECTED] wrote:
Hello,
what about the non-commutative part of Singular (formerly known as
Plural)?
Singular-Plural has one disadvantage though: It can not deal with free
algebras. You
I helps a little, but getting from non-privileged shell to root shell
provided you have compilers isn't very hard.
Do you claim any ordinary user can become root? I.e. that the
unix security model is worthless? Surely this is not what you mean.
Can you clarify?
Regards,
Michel
I think the trick is not to run the processes in the chroot as root.
I used a command like this (as root)
/usr/sbin/chroot chroot_directory su - sage -c sage -c \$COMMAND\
Thus the sage process inside the chroot is run by a user sage.
I am not sure how secure this is. Any ideas?
Michel
Yes. Who would have expected the existence of a faster
generic algorithm to compute the order of an element in a group.
Michel
On Sep 6, 1:50 pm, Bill Hart [EMAIL PROTECTED] wrote:
But WOW, what an amazing thesis!! I think you sent this one to me
before, yes? But this is the first time I
steps and on how fast
the numerators/denominators grow. I am sure the elliptic curve experts
on this forum can say more about this.
Michel
On Aug 14, 10:41 pm, David Harvey [EMAIL PROTECTED] wrote:
On Aug 14, 2007, at 4:19 PM, Alex Ghitza wrote:
Hi,
I've looked at ticket #59, in which
.
Michel
On Jun 27, 9:39 am, William Stein [EMAIL PROTECTED] wrote:
Hi,
SUMMARY: I've made the public SAGE notebook servers
nontrivial to seriously vandalize or kill... I hope. Try to
crack them (especiallyhttps://sage.math.washington.edu:8102).
DETAILS:
For the first time in history
automatically (or on demand).
Having to push restart when you log in is confusing.
Michel
On Jun 27, 9:56 am, William Stein [EMAIL PROTECTED] wrote:
On 6/27/07, Michel [EMAIL PROTECTED] wrote:
Doing
sage: import os
sage: os.system('whoami')
sage10
sage: os.system(kill -9 `ps -u sage10
they could
execute
denial of service attacks against other computers. Shouldn't internet
access
for notebook users be turned off by default?
Michel
On Jun 27, 10:25 am, Michel [EMAIL PROTECTED] wrote:
So the notebook processes are executing the actual sage commands?
What is then the notebook server
correctly the notebook users
sage** have easy to guess passwords which is also bad of
course!
Michel
On Jun 27, 11:20 am, Michel [EMAIL PROTECTED] wrote:
So far everything looks good. For serious testing one would need the
source
of the notebook.
Here are some points.
(1) Practically the whole
only
specific host access
(which would of course still allow DOS attacks against those
hosts)
Anyway I realize this is not a sage issue but a firewall issue.
Michel
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
The new notebook looks very good.
Here is another quirk. I pressed help in a worksheet and as expected
got to the help page. However my name was given as Timoty Clemans!
More importantly it is quite unclear to me how to go back from the
help
page to the worksheet!
Michel
On Jun 22, 7:51 am
The following command seemed to kill the notebook process.
os.system(kill -9 `ps -u server4 -o pid=`)
I was unable to log in afterwards. Shouldn't the notebook process
be restarted automatically?
Regards,
Michel
--~--~-~--~~~---~--~~
To post to this group
Sorry,
Didn't read the note. I guess I hadn't understood that notebook
processes running under a different user and ssh had anything
to do with each other. I hope the new security model gets
turned on soon!
Michel
On Jun 21, 10:56 pm, Timothy Clemans [EMAIL PROTECTED]
wrote:
This is very nice
Things like this are definitely needed. So what came out of the
redesign
of the coercion model at SD4?
Michel
On Jun 20, 6:14 am, [EMAIL PROTECTED] wrote:
A while ago, I wrote a little function that took a multivariate polynomial
into a corresponding recursive univariate polynomial. Would
William,
A while ago I reported that the implementation of
RR(0).exact_rational()
made some machines run out of memory, giving weird
doctest errors.
You posted a patch (special casing zero) but I now see
in the source of sage-2.6 you forgot to apply it.
Can you please apply!
Regards,
Michel
Everything working here! I look forward to the new security measures
to do some real testing:-)
Regards,
Michel
On Jun 16, 10:40 pm, William Stein [EMAIL PROTECTED] wrote:
On 6/16/07, Timothy Clemans [EMAIL PROTECTED] wrote:
I'm getting a strange error in Firefox 2.0.0.1 under Linux on my
://emis.uhasselt.be/sage_patches/next_prime_inconsistencies.patch
Michel
On Jun 8, 5:49 pm, Jack Schmidt [EMAIL PROTECTED]
wrote:
My benchmarks agree. The gap between primes is so small as to make my
communication point moot. Even checking some of the record setting
prime gaps, the pure pari
many tricky isues, not the least the
authentication
of the user versus the controlling process. This is important
since it would determine the userid and home directory for the slave
process.
There are many more securithy issues that would have to be dealt
with.
Michel
On Jun 7, 12:01 am
these methods/functions should have identical behaviour.
What do other people think?
Michel
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit
And what should the default be? I would vote for probable primes
since looking for provable primes is unbearably slow.
Michel
On Jun 7, 8:01 pm, David Joyner [EMAIL PROTECTED] wrote:
Michel wrote:
It has often bothered me that there is a big difference in
performance between
next_prime
Hi,
This thread started because (...).next_prime()
and next_prime(...) behave differently. So I assume this
can be fixed immediately?
As to provable/probabilistic. I am worried about
global modes since people will forget about them
Michel
On Jun 7, 8:19 pm, William Stein [EMAIL PROTECTED
Whoops,
I just looked at the code again. Wouldn't it be much better
to call pari's next_prime function. Test for primeness, if true,
return,
if false, call next_prime again etc...?
That should be ***much*** faster than the current method.
Michel
On Jun 7, 8:38 pm, Michel [EMAIL PROTECTED
I guess you mean the opposite. The pseudoprimetest
used internally by pari should never declare a prime number
to be composite. Most likely they use Miller Rabin which
has this property. I will check.
Michel
On Jun 7, 8:54 pm, William Stein [EMAIL PROTECTED] wrote:
On 6/7/07, Michel [EMAIL
Unfortunately I was too quick as well...
It is not actually faster to use the pari next_prime
function. This is because is_prime is of course
extremely fast at detecting composite numbers.
Michel
On Jun 7, 9:28 pm, William Stein [EMAIL PROTECTED] wrote:
On 6/7/07, Michel [EMAIL PROTECTED
On Jun 6, 2:04 pm, Michel [EMAIL PROTECTED] wrote:
Input from my son who is fascinated by security.
On my setup at least the notebook user can
kill the sage binary, needing manual intervention
to start it again.
How to guard against that?
Michel
Well instead of starting
su
Yep this solution seems to work quite well. My son remarked
that when restarting sage it is necessary to also kill all processes
run by sageuser. Otherwise sageuser could start a process which
would be on the lookout for new instances of sage and kill
these also!
Michel
On Jun 6, 6:40 pm
.
Ah: maybe your point is that if the user kills his own
sage process he is just shooting himself in the foot?
So no special action should be required...
Michel
On Jun 6, 8:07 pm, William Stein [EMAIL PROTECTED] wrote:
Hi,
The better solution -- in the long run -- is that each SAGE worksheet
:00:00 sh
.
sage: os.system(kill -9 6418)
I don't see how sage can recover from this (on my system it didn't).
Unless it is started by some kind of monitoring process running as
root.
On Jun 6, 9:33 pm, William Stein [EMAIL PROTECTED] wrote:
On 6/6/07, Michel [EMAIL PROTECTED] wrote:
Yes
to kill sageprocess5 but nothing
else. Moreover sageprocess5 would be restarted immediately.
Everything is fully isolated. No security risk whatsoever.
One would need a system with a lot of memory of course.
Michel
--~--~-~--~~~---~--~~
To post to this group
the jail and start the notebook as follows
#/usr/sbin/chroot /sage-root su - sage -c sage -notebook
Are there any security problems associated with this?
Michel
On Jun 5, 2:15 pm, Michel [EMAIL PROTECTED] wrote:
I have compiled sage from source in a FC7 chroot environment on FC4.
Everything
This one!
Hope the URL works.
http://groups.google.com/group/sage-devel/browse_thread/thread/ea56d4fc266fd79b/7bc0cb3bb2ff28cc?lnk=stq=rnum=4#7bc0cb3bb2ff28cc
Michel
On Jun 5, 2:46 pm, Kate [EMAIL PROTECTED] wrote:
Michael,
Which thread?
Kate
On Jun 4, 2:04 pm, Michel [EMAIL PROTECTED
Ok thanks for the explanation.
BTW
My name is Michel and not Michael!
On Jun 5, 3:54 pm, Kate [EMAIL PROTECTED] wrote:
Michael,
Thanks for the URL. (Alternately, you could have told me to look
in the
maxima.console() works but not maxima.interact()
thread.)
I do not have
display.
Since there is already a display2d method I don't see why str(...)
could not return the 1D version.
Michel
On Jun 5, 7:42 pm, Joel B. Mohler [EMAIL PROTECTED] wrote:
On Tuesday 05 June 2007 12:09, William Stein wrote:
On 6/5/07, Joel B. Mohler [EMAIL PROTECTED] wrote:
sage: maxima
Personally I think the extra patent protection provided by the GPL3
would be a good thing for SAGE and for open source CAS's in general.
But I assume this issue depends mainly on the software SAGE itself
depends on.
I might be mistaken but I think Maxima is GPL2 only.
Michel
PS. I think
that a path
contains at least
two /'s which is not satisfied in my case.
I assume this function should just bail out in the case that a path
contains 0 or 1 slashes.
But since I do not fully understand what strip_automount_prefix is
supposed to do
I would like some input on this.
Michel
PS. Strictly
Does anybody recognize this situation? In particular I am very worried
that my
prompt is In [x]: and not sage:... What could possibly cause this?
This I could solve by deleting all .directories in the home
directory.
Remains the fact that interfaces don't start from within sage.
Michel
On Jun 4, 2:46 pm, William Stein [EMAIL PROTECTED] wrote:
Thanks for the bug report about strip_automount_prefix. Please try
the attached sage-test.
On 6/4/07, Michel [EMAIL PROTECTED] wrote:
I am working on my chroot jail but this time I am stuck. Doctests fail
because SAGE
-maxima.lisp works fine at the bash
prompt (I have
done install-scripts).
Does anybody recognize this situation? In particular I am very worried
that my
prompt is In [x]: and not sage:... What could possibly cause this?
Michel
--~--~-~--~~~---~--~~
To post to this group
I building SAGE in a FC7 chroot jail in FC4. Everything went fine
until Singular
Singular has problems with ndbm.dl_o. What is ndbm.dl_o???
Michel
==Error message
make[3]: Entering directory `/root/sage-2.6/spkg/build/
singular-3-0-2
I building SAGE in a FC7 chroot jail in FC4. Everything went fine
until Singular
Singular has problems with ndbm.dl_o. What is ndbm.dl_o???
Michel
==Error message
make[3]: Entering directory `/root/sage-2.6/spkg/build/
singular-3-0-2
but that are apparently necessary for
building SAGE.
Michel
On Jun 4, 4:55 pm, Martin Albrecht [EMAIL PROTECTED]
wrote:
On Monday 04 June 2007 16:39, Michel wrote:
I building SAGE in a FC7 chroot jail in FC4. Everything went fine
until Singular
Singular has problems with ndbm.dl_o. What
William already posted a patch to this in another thread!
On Jun 4, 7:39 pm, Nick Alexander [EMAIL PROTECTED] wrote:
PS. Strictly speaking one should use os.path.separator instead of
/ :-)
Perhaps os.path.realpath and os.path.normpath are even better? I
think Kate Minola will have to
an interface) has some
stuff on Lie algebras and root data
but it probably does not go beyond what you list
under (0) (and probably it does far less).
Michel
PS. Not directly related to what you wrote.
A system that knows about enveloping algebras of Lie algebras is
Plural
(the non-commutative algebra
it be that the multiplication of sparse matrices
is not as optimized as it should be? I looked in
matrix_generic_sparse.pyx
but I don't even see a _mul_ method. Where is multiplication
of sparse matrices implemented?
Michel
On Jun 2, 4:23 am, Mike Hansen [EMAIL PROTECTED] wrote:
I thought I
in
this manual.
Michel
On Jun 2, 3:02 pm, Martin Albrecht [EMAIL PROTECTED]
wrote:
On Saturday 02 June 2007 14:59, David Harvey wrote:
On Jun 2, 2007, at 8:44 AM, Michel wrote:
There is something I have not fully understood yet.
If I understand correctly doctests appears in the documentation
would assume that
show and save is basically the same code...
Michel
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http
factorcaching requires a
bit understanding from the
user but the payoff is enormous. Anyway as I said factor caching
should be optional. And furthermore there
is an auto_reduce parameter, which when true emulates the current
behaviour.
Michel
PS. Perhaps it is possible to make your example work out
objects like spheres etc..., presumably not a big deal.
For function plotting meshes are ideal.
Michel
On May 29, 12:33 am, William Stein [EMAIL PROTECTED] wrote:
On 5/28/07, Robert Bradshaw [EMAIL PROTECTED] wrote:
I'm just glad those are the only two sticky issues. I think we're
fine
1 - 100 of 174 matches
Mail list logo
