If the question is "are there applications of Grobner bases over ZZ?"
then the answer I believe is yes. George Nakos, a colleague 2 doors
down the hall
who implemented one of the first Grobner basis computaitons over ZZ
(for Mma, years and years ago) for the purpose of doing homotopy
computations
On Feb 9, 2007, at 11:28 PM, William Stein wrote:
>
> On Fri, 09 Feb 2007 16:18:16 -0700, David Harvey
> <[EMAIL PROTECTED]> wrote:
>
>> BTW that ell_rational_field.py is getting kind of ridiculously big.
>
> Indeed! It desparately needs to be broken up. I t
relation, which seems to be the main
ingredient missing in the real interval case.
Do you have any other examples of undesirable behaviour apart from
the business with the leading term of a polynomial? My feeling is
that it's the code in the polynomials that needs to ch
ave some idea of the error in your
input data then the system automatically gives you proven error
bounds in the output. Is that the basic idea? I take it the whole
real interval thing is not just some academic curiosity.
David
--~--~-~--~~~---~--~~
To post
ementation of RealInterval, pAdicField, etc.
I'm not sure exactly why the python people impose this rule. I guess
if you are looking up a key in a hashtable, you hash the key, look in
the appropriate bucket, loop over all items in the bucket. Things are
going to be pretty weird if the
azy p-adics and power
series, you should let me know so I can take your application into
account in the design.
David
On Feb 12, 2:38 am, "Michel" <[EMAIL PROTECTED]> wrote:
> I am wondering what Sage's strategy is with regard to coercions.
> It thought that i
t once, if that
proves to be taking up time.
Similarly we would need a destructor.
I'm sure it's not quite as simple as what I've put in the above list,
but let's just see what we can do. I would like it to be as close as
possible to the int
On the perhaps premature thought that this is spam, I banned him from
posting again.
If someone knows him or can vouch it isn't spam, please email me offlist.
Thanks.
Timothy Clemans wrote:
> Thanks to Google I have some idea of what ramoncito said.
> "Good, the following thing is for asking that
On 2/18/07, William Stein <[EMAIL PROTECTED]> wrote:
> Hello,
>
> Certain kind researchers at Microsoft Rsearch have code they would like to
> contribute to SAGE. They are only allowed release it under the Microsoft
> Permissive License, which is described here (and linked to):
>
>
> http://www.m
I did this and had no problem compiling on a amd64 suse10.0 machine.
+++
On 2/18/07, Jason Martin <[EMAIL PROTECTED]> wrote:
>
> Hi All,
>
> I've been tweaking the gmp used in sage. Right now this will only
> benefit Linux users who have a core2 processor. Howev
slice operator
for p-adic fields and this is stymieing me (yes, that is how you spell
stymieing: I just looked it up).
David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL
ete description of the genus 0 AG codes. I'm not sure if SAGE's
divisor classes even work in genus 0 so this may not be completed for
quite awhile.
If any of this sounds interesting, please let me know.
- David
+++
On 2/21/07, Pere Urbón
Pere Urbón Bayes wrote:
> El dj 22 de 02 del 2007 a les 08:15 -0500, en/na David Joyner va
> escriure:
>
>> Hi Pere, good to hear from you again.
>>
>> 1. Nick Alexander's suggestions (e.g., coding theory over rings) are good
>> ones.
>>
>>
On 2/25/07, Pere Urbón Bayes <[EMAIL PROTECTED]> wrote:
>
> > If you read that program and then write something else, it is by
> > definition
> > a derivative work. What is the license of Leon's program? if it isn't
> > open source,
> > then reading it and writing something based on it is a poten
actually set in advance how many iterations
to perform; we let the software decide that based on how long each
iteration is taking.
David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send
re are some useful ideas in there for you. It includes a
stripped-down implementation of SAGE's "point" class so that you can
draw graphs with many points much (!) more quickly than SAGE can.
Probably could be made faster with the gd library but that's for
another day.
David
--~-
several
>> fields to make a serious proposal). Also, even in scientific notation
>> it would display the fixed number of digits, right?
>
> I second doing something more efficient.
Can I add to that: for very high precision, even just the binary =
On 3/1/07, Joel B. Mohler <[EMAIL PROTECTED]> wrote:
>
> I'm wondering if we could have an update on the basic calculus rewrite which
> was discussed a while ago on the mailing list?
>
> I'm giving a talk on SAGE in a week and I might want to have a basic calculus
> demo if it's ready to show.
>
>
Done.
On 02 Mar 2007 08:41:48 +0100, Martin Rubey <[EMAIL PROTECTED]> wrote:
>
> Dear maintainers,
>
> please unsubscribe me from the list. Something went wrong with my google
> account and I cannot access my subscription anymore. (I only used it for sage)
>
> Many thanks
>
> Martin
>
>
> >
>
-
Keep up the great work you're doing. If I get enough time, I may email you again
over spring break to ask you some questions about how to improve the tutorial
based on your new stuff.
On 3/2/07, Bobby Moretti <[EMAIL PROTECTED]> wrote:
> Hey Joel,
>
>
> >
> > I'm wondering if we could have an upd
check the docstring for the function. Of course, this still leaves the
question of which is the default...
Anyway, I'm planning on doing this for p-adics. Thought I might throw the
idea in for integers too.
David
>It's always bugged me that the default distribution for integers (an
Timothy Clemans wrote:
> Is there a way to block some of this spam?
If there is, please let me know. These people register and post almost
immediately. I ban them as soon as I can and delete their post from the
archives. It appears to me that if we allow anyone to sign up to this
list then this
Hi,
Another feature that I find extremely useful are the quotient rings
(currently not implemented).
This allows one to work in a well-defined ring, and control precision
precisely.
--David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel
I tried sending a response a while ago, but it didn't seem to get
through.
I'm including a response to David Kohel's e-mail at the bottom of
this.
> Congratulations on the new p-adic model. This really looks very
> promising and extensible.
Thanks.
> - It shou
le-version.hg
will have a version that passes all doctests. That means I'm sending
it off to William, but
if you want it faster you can get it from there. And
sage.math.washington.edu/home/padicgroup/development-version.hg
has the most recent version. I'll only update that when the
sage and quite
> confusing. E.g.
> consider
>
> [i for i in GF(5)]
That's definitely a bug. I'll report it to trac, and also to whom I
suspect is the author of that code, who is sitting right next to me :-)
david
--~--~-~--~~~---~--~
://sage.math.washington.edu/home/dmharvey/patches/intmod_iter.hg
david
On Wed, 14 Mar 2007, Michel wrote:
>
> The bug seems to be at line 458 of integer_mod_ring.py. I assume that
> the line
>
> yield i
>
> should be replaced by
>
> yield integer_mod.IntegerMod(self, i)
>
&
Moretti - Calculus
> * William Stein - Modular forms
> * William Stein - Modular abelian varieties
> * David Roed - Updated p-adics
> * William Stein - add p-adic docs to the reference manual
> * David Harvey - bug fixes
> * Clement Pernet - new linbox charpoly
> * Martin Albr
yer is a .pxi file and maybe a few C++ helper functions to make
> utilizing NTL
> from other SageX classes super-simple. At the moment, the naming
> schemes
> between my .pxi stuff and the NTL names are a bit of mish-mash. I
> enlarge on
> these comments in what foll
; math software. The
> ntl.pyx file provides NTL with almost the same *semantics* as NTL.
> For this, the objects in ntl.pyx must stay mutable (since they are in
> ntl), and the file itself obviously should continue to exist. That
> said, as David H suggests objects like
> polynomials
ent *elements* of the number field, you need
denominators. Probably best to represent elements using a polynomial
in Z[x], with a single denominator, which is I think what you've been
suggesting.
David
--~--~-~--~~~---~--~~
To post to this group, send
Hello all:
Has anyone here heard of pydx?
- David Joyner
--~--~-~--~~~---~--~~
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
ians four years. The final computation took more than
three days' solid processing time on a Sage supercomputer."
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [
On Mar 19, 2007, at 9:58 AM, Mike Hansen wrote:
> I guess this is mostly directed toward David Joyner, but if anyone
> else knows, feel free to chime in. I've been trying to figure out the
> best way to do calculations in a group ring or group algebra. I've
> checked a
On 3/19/07, Mike Hansen <[EMAIL PROTECTED]> wrote:
>
> I guess this is mostly directed toward David Joyner, but if anyone
> else knows, feel free to chime in. I've been trying to figure out the
> best way to do calculations in a group ring or group algebra. I'
number/function rings would give insight into both
the modular theory (i.e. over finite fields) and characteristic zero,
so the computational infrastructure should be set up generically.
--David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel
Are you using ONAG for the main reference? In any case, I would appreciate
a precise reference to a book or article on nimbers.
On 3/19/07, Michel <[EMAIL PROTECTED]> wrote:
>
> Hi,
>
> To acquant myself with sage's inner workings I have implemented
> Conway's nimber field.
> See
>
> http://alpha
On 3/19/07, Mike Hansen <[EMAIL PROTECTED]> wrote:
>
> > Did you look at LAGUNA or UnitLib?
>
> Yeah, I looked at LAGUNA, and it wasn't exactly what I was looking
> for. I guess I'm more interested in the looking at the group algebras
> as K[G]-modules.
If I understand correctly, the following i
ements of finite fields, extensions
> of finite fields, padic extensions, etc. Same with lattices of number
> fields over QQ and ZZ, and embeddings into CC.
Oh boy I really really don't like where this is going. Insisting on
"a == b&
GE equality", and implement SAGE equality as
a new method attached to each object. Then we could follow python
rules for "==" and our rules for everything else, and all SAGE code
would become completely unreadable (and for that matter unwr
can have two elements of the same ring with different
precision and hence presumably different hashes, which still compare
equal). Second, I can't even see technically how you would do that
without modifying python in some horrible way.
David
--~--~-~--~~~--
ut parents being
> mis-matched -- I think this is a bug in itself.
>
> Any comments?
Exactly which quo_rem() method are you talking about? Which class?
David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscrib
of a wikipedia
page. It used to say:
"The final calculation was carried out using William Stein's SAGE
system at University of Washington."
The correction was made by yours truly, less than 24 hours ago.
David
--~--~-~--~~~---~--~~
To post
Let me be the first on this list to congratulate you! IMHO, this is a
big contribution..
Can you give some timings, comparing your package vs nauty?
I'm not sure how to browse a patch and even if I did, I'm not sure I'd
understand your code. How much is Sagex and how much is Python?
+++
On 3/23/07, William Stein <[EMAIL PROTECTED]> wrote:
>
> Hi,
>
> sage.math.washington.edu is back. If you have an account there, you
> should be able to log in with ssh.
>
> 1. The operating system is amd64 Debian. This is a completely fresh install,
> so it's likely some packages you might need
e this I haven't
> copied /usr/local over yet.)
svn please.
David
--~--~-~--~~~---~--~~
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
NOT usually called by a
one-line call to factorization or discrete log. Generally the
algorithm
is (only?) suitable for distributed computation. A good QFS (after
Pollard rho [and ECM for factorization problems]) should suffice
for any stand-alone system.
--David
All tests passed on suse 10.2 amd 64 bit.
Jaap Spies wrote:
> Jaap Spies wrote:
>
>> There were no problems what so ever with sage-2.4.rc3 on FC5:
>> --
>> All tests passed!
>> Total time for all tests: 1093.9 seconds
>> [EMAIL
Build (for rc3) went fine on my machine (32 bit MacBook Pro, OS X
10.4.9)
real61m23.087s
user38m43.449s
sys 15m50.664s
Make test:
All tests passed!
Total time for all tests: 1732.5 seconds
David
On Mar 25, 5:52 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> Ca
> To David Kohel: index calculus for discrete logs uses linear algebra mod p-1
> (not 2).
Yes, I overstated the similarities between factorization and dlogs.
--David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.
plies by 2^n (before 2.4 I think it had to be a positive
integer). If you want to be able
to shift by arbitrary real values then change the code for __lshift__
and __rshift__ for the reals.
David
On Mar 25, 11:24 pm, "didier deshommes" <[EMAIL PROTECTED]> wrote:
> This is stra
On Mar 26, 2007, at 6:57 PM, didier deshommes wrote:
>
> On 3/26/07, David Roe <[EMAIL PROTECTED]> wrote:
>>
>> Two things. First, order of operations is not what I would expect:
>> your first code is equivalent to
>> sage: 1 << (3 + 1.2).
>
> Ye
vely forever. I don't know enough about what that function is
supposed to do to fix the bug. My gut feeling is that
Integer.__lshift__ shouldn't be using the coercion module; or at least,
the semantics for coercion for the shift operator need to be clarified.
David
--~--~-~
SageX art
> for making these things fast? Does someone have a trick up their
> sleeve to get
> these basic arithmetic operations a bit faster from the python shell?
At the moment there are so many different reasons that the code could
be slow, I don't think you've at all
I see Didier Deshommes has registered. I just did as well,
but don't know (if or) when I'll how up (it depends on other
variables).
On 3/27/07, Jason Martin <[EMAIL PROTECTED]> wrote:
>
> Hi All,
>
> Are any Sage evangelists planning to attend the East Coast Computer Algebra
> Day?
>
> http://ec
I can help for about 1 week starting Thursday.
On 3/27/07, William Stein <[EMAIL PROTECTED]> wrote:
>
> Hi,
>
> Would anybody like to volunteer to recreate the Conway polynomials
> database from the raw text data? I screwed up and lost any code used
> to create it. Let me know if you're interes
bout an initial subset
in the same order?
David
--~--~-~--~~~---~--~~
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://groups.google.com/group/
AIL PROTECTED]> wrote:
> On 3/29/07, David Roe <[EMAIL PROTECTED]> wrote:
>
> > I sent this a little while ago but it didn't seem to go through...
> > sorry if it appears twice.
>
> > What do people think of having a canonical map between multivariate
> &g
tible.
What is the condition for compatibility?
David
--~--~-~--~~~---~--~~
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://groups.google.
Move polynomial_element_generic, etc to rings/polynomial and
put the polynomial code in there? Put the matrices in matrix/padic?
I don't want to pollute the file space too much by creating lots of
files, so...
David
--~--~-~--~~~---~--~~
To post to this group, send ema
I can try writing the matrices using SageX...
Then working with 1x1 matrices might be faster than working with
padics...
;-)
David
On Mar 29, 11:59 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On 3/29/07, David Roe <[EMAIL PROTECTED]> wrote:
>
> > So, I
, where the algorithm for integer matrices
is just the naive algorithm.
David
On 3/30/07, Robert Bradshaw <[EMAIL PROTECTED]> wrote:
>
>
> On Mar 29, 2007, at 10:15 PM, William Stein wrote:
>
> > On 3/29/07, Robert Bradshaw <[EMAIL PROTECTED]> wrote:
> >> I thin
t,
modified_entries, copy=copy, coerce=coerce) sometime in here.
Am I missing something?
David
--~--~-~--~~~---~--~~
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
On 1/4/07, Joshua Kantor <[EMAIL PROTECTED]> wrote:
>
> In response to Williams sage-2.0 plan I wanted to describe what I had done
> with using gsl to implement a numerical ode solver. I believe that the
> patch containing this will be applied after
> doing a recent pull or upgrade but I'm not su
code. I've included the .pxd file
below (I moved the arrow to where it actually points to for those of us
without fixed-width fonts). If anybody could point out what I'm doing
wrong, I'd appreciate it.
David
include "../ext/cdefs.pxi"
cimport matrix_dense
cimport sage
604023: 4}
Naively, this seems like the wrong behavior: they should all be distinct.
Now, maybe I just need to set the seed manually. It seems like we could set
the seed by default with some other source of randomness though...
David
--~--~-~--~~~---~--~~
To post to
ina State University, USA
Anton Leykin, University of Minnesota, USA
Marc Moreno Maza, University of Western Ontario, Canada
Jean-Louis Roch, Universite Joseph Fourier, France
David Saunders, University of Delaware, USA
William Stein, University of Washington, USA
Carlo Traverso, Universi
Thank you for posting that Martin.
Martin Albrecht wrote:
> This might be a bit off topic, but someone wrote a nice review of SAGE at
>
> http://georgm.blogspot.com/2007/03/sage-computer-algebra-system.html
>
> Sorry for any inconvenience caused,
> Martin
>
--~--~-~--~~-
I deleted this from the archives and banned him from
posting or joining again.
On 4/7/07, <[EMAIL PROTECTED]> wrote:
>
> MAKE ME RICH NOW.
> READ THIS AND I WILL
> GET STARTED IN 2 MINUTES
>
>
> TURN $6 INTO $15,000 IN ONLY 30 DAYS&HERE'S HOW!
> You have most likely seen or heard about t
I banned this poster, reported it as spam, and deleted the post from
the archives.
On 4/8/07, mike <[EMAIL PROTECTED]> wrote:
>
> Find Your Programming Job Vacancy and resources here -->
> http://www.jobbankdata.com/job-programming.htm
>
>
> >
>
--~--~-~--~~~---~--~-
http://sage.math.washington.edu/home/dmharvey/sage-in-spain.jpg
"Pasión por el software"
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED
The scipy.org mirror seems to be okay, but I too noticed the
permission problems (which I think mess up the -d option to rsync).
Thanks for pointing this out. Since the binaries are also
mirrored, I would imagine we have over-stepped our soft-quota
at our scipy.org server (which is 10G). I haven'
On 4/12/07, David Roe <[EMAIL PROTECTED]> wrote:
>
> I just took a look at the Python 3000 PEP. A couple of points where
> things due to be phased out are commonly used in SAGE:
> -- raise ValueError, "That number shouldn't be zero" -- now illegal
> -- rai
m(B)
> [0]
I don't understand the problem. In all cases, the number of rows of A
plus the number of rows of B equals the number of rows of
A.block_sum(B), and similarly for columns. What am I missing?
david
--~--~-~--~~~---~--~~
To post to this group, s
On 4/13/07, Timothy Clemans <[EMAIL PROTECTED]> wrote:
>
> If SymPy was written in C++ and had a Python interface in it what
> would be the likely hood of it being the backend for symbolic
> computation in SAGE?
Are you talking about Yacas?
http://www.koders.com/python/fidDCC1B0FBFABC770277A288
He's been banned, reported, and the post removed from the archives.
On 4/13/07, Timothy Clemans <[EMAIL PROTECTED]> wrote:
>
> Too bad google does not send spam to admins for review.
>
> On 4/13/07, www_ieshoes_com <[EMAIL PROTECTED]> wrote:
> >
> >
> >
> > Main Menu Search Basket Content Check
None and max is not None:
a = min
b = max
return self._new_c((b-a)*random() + a)
else:
Dist =
sage.gsl.probability_distribution.RealDistribution(distribution,
parameters)
return Dist.get_random_element()
David
--~--~-~--~~--
It appears you have failures in functions.py, combinat.py, and piecewise.py.
Except maybe for some stuff at the bottom of the file, I didn't write
functions.py. The AUTHOR info etc in the top docstring is missing.
However, I did write combinat.py and piecewise.py.
All I can say is
(a) the comman
On Apr 16, 2007, at 10:24 PM, Robert Miller wrote:
> sage: M = Matrix(GF(2), [[1,1,0],[0,0,1]])
> sage: M.row_space()
>
> Vector space of degree 3 and dimension 1 over Finite Field of size 2
> Basis matrix:
> [1 1 0]
yeah
; -1940.027296
> -1808.707296
> -1677.137296
> -1543.907296
> -1410.187296
> -1279.297296
> -1146.907296
> -1016.587296
> -885.917296
> -752.657296
> -620.757296
> -489.627296
> -358.087296
> -224.227296
> -94.367296
> 36.762704
>
> and so on, s
m for doing educational mathematics on these machines,
assuming they could make available servers with enough grunt to run
SAGE itself.
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group,
On 4/23/07, didier deshommes <[EMAIL PROTECTED]> wrote:
>
> Hi there,
> I've noticed 2 problems with tne notebook:
...
>
> -- When running SAGE from $SAGE_ROOT, every time I create a new
> worksheet, it is created in "GAP mode" (a new feature in 2.4.2, I
> think). This does not happen when I run
ease let me know what you think of all of this, and if you have
ideas/suggestions/etc. I have a few spin-off things that I've been thinking
about that I'll write follow-up e-mails for.
David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-
manually cast an element of a RealCompletionField
into RR. Similarly for ComplexCompletionField (I suppose I choose one of
the conjugate embeddings arbitrarily) and pAdicCompletionField.
David
On 4/26/07, David Roe <[EMAIL PROTECTED]> wrote:
>
> In the course of thinking about coercion for
braic
topology? I hear that Singular has a library for doing ext and tor, etc (I
think it's called homolog_lib).
David
On 4/26/07, David Roe <[EMAIL PROTECTED]> wrote:
>
> In the course of thinking about coercion for p-adic rings, fields and
> extensions, I've had some i
On Apr 26, 2007, at 8:55 PM, David Roe wrote:
> Please let me know what you think of all of this, and if you have
> ideas/suggestions/etc. I have a few spin-off things that I've been
> thinking about that I'll write follow-up e-mails for.
I just want to pipe up here:
a morphism to the default diagram. Etc.
When you create a finite field of prime order, diagrams[FiniteFields] will
add an entry point from ZZ to the prime field. diagrams[FiniteFields] will
then build a lattice of compatibly embedded fields as you create new
extension fields of that prime field.
fields at
prime ideals in SAGE. This is impacted be the ongoing discussion of
augmenting the coercion model.
David
On 4/27/07, William Stein <[EMAIL PROTECTED]> wrote:
>
>
> Hi,
>
> John Cremona has implemented a wide range of height bounds for
> elliptic curves i
On Apr 27, 2007, at 12:54 PM, David Roe wrote:
> I'd be happy to do it. Having just read through the code, it looks
> like it shouldn't be hard, with the following potential hangups:
> Does SAGE have Tamagawa numbers, Kodaira symbols and minimal models
> for elliptic
sms that should be used by the coercion
> > system automatically. This list is would be immutable. So there
> > would be a new number field class NumberField_with_embedding(s).
>
> I think this should be an ability of any parent (with gens?), and one
> would not necessar
. Namely, it is planned to be a developers workshop,
with fewer general audience talks.
If you think you can make it and are interested in attending, please email
me ([EMAIL PROTECTED]) or this list. If there is sufficient interest,
then we will try to get funding and take it from there.
- David
This poster has been banned and the post deleted but for some reason google's
"report post as spam" feature is not working.
On 4/27/07, Secret <[EMAIL PROTECTED]> wrote:
>
> If you are an atheist, please read the section below with the title
> "Why Atheism and Evolution are not good ideas."
>
> A
ative indexing
will make their lives easier.
David
On 5/6/07, Nick Alexander <[EMAIL PROTECTED]> wrote:
>
>
> [EMAIL PROTECTED] writes:
>
> > +1 for consistency across the board.
>
> +1 from me too. I'd like to learn Pyt
oftware system" without really losing anything. It does
sound a bit like a late-night TV ad.
Be a little careful calling MAGMA commercial software. But I don't
know how to rephrase it without getting very wordy.
On the mailing list pages you have sage-devel listed twice, same with
On May 6, 2007, at 7:59 AM, Timothy Clemans wrote:
> It is taking me along time to get much but what I have so far is at
> http://tclemans.nonlogic.org/sage/
No.
David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.
xist yet, but why bother if someone just says no.
Sorry mate, I just like the basic thrust of William's design better
than what you have proposed. I would offer more constructive
criticism, but I'm busy with other things.
David
--~--~-~--~~~---~--~~
have more support-related stuff - perhaps
a link to the tutorial.
+++
William Stein wrote:
> Hi Georg and David,
>
> I'm doing a redesign of the SAGE website to target SAGE much
> more at end users rather than develop
ndly.
One option might be: put the logo where the "SAGE" is now, and then
on the next line, instead of
Free Open Source Mathematics Software
do
SAGE: Free Open Source Mathematics Software
David
--~--~-~--~~~---~--~~
To post to this group, send email
ter if it was flush on the bottom of
the page. If we do have to have the car, at least we should make it
clear that our car is solar-powered, unlike the large commercial
manufacturers.
David
--~--~-~--~~~---~--~~
To post to this group, send email to sage
I'm starting to agree with some people on this list, maybe the Big Four
links in the middle are simply unnecessary. The menu at the top is
pretty short and sweet. I think people can probably find what they want
there.
BTW the latest iteration is looking pretty gorgeous.
601 - 700 of 6542 matches
Mail list logo
