[sage-devel] Re: SCREMS proposal

2008-01-10 Thread David Harvey

Here are some random things, nothing terribly important.

project_summary.pdf:

* "Kazhdan-Lusztig-Vogan" should use en-dashes not hyphens (this  
occurs in a few other files too I think, also Sato-Tate, etc. (but  
not Swinnerton-Dyer!))

* "Much of the data that arises out of these projects will also be of  
great value to large parts of
mathematics." Perhaps of great value to mathematicians, rather than  
mathematics per se?

* It's a bit puzzling the way Sage is introduced on that page. Maybe  
it's okay given some context I don't know about, but it looks a bit  
odd there without further explanation.

project_description.pdf:

* Ghz => GHz (this occurs a few times)

* after "possibilities", should be an em-dash.

* the headings in section 2.1.1 are aligned funny. "Further KLV  
computations" has different indentation from the following headings.

* jordan-holder, I *think* holder has an umlaut, although the  
internet doesn't totally agree with me

* Is it "Wiles'" or "Wiles's"? I'm not sure, but you use both :-)

* p9: write "for example" not "e.g."

* "Q curve" or "Q-curve"? Pick one and stick with it.

* there's a funny space between "doubly even" and the comma

* p12: probably better to write "with respect to" instead of "w.r.t"

* the phrase "High amounts of symmetry" sounds not-quite-right to me,  
but I can't think of a better way.

* "Google source code system.",   -- the punctuation here is wrong. I  
think it should be "Google source code system," said  ...

Stein bio:

* 284 page => 284 pages

* the paper on computation of p-adic heights is not "to appear", it  
has well and truly appeared, but you knew that :-)

Tired. Must sleep.

david


On Jan 10, 2008, at 8:47 PM, William Stein wrote:

>
> Hi,
>
> The Screms proposal is now completely done, but it's possible for me
> to make some last minute minor
> typo fixes tomorrow morning.  I've posted the latest version here:
> http://wstein.org/grants/screms/
>
> If you notice _any_ typos or mistakes at all, definitely let me know.
> The proposal is supposed
> to be perfect right now.
>
>   -- william
>
> -- 
> William Stein
> Associate Professor of Mathematics
> University of Washington
> http://wstein.org
>
> >


--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: DFA package for inclusion

2008-01-10 Thread David Joyner

First, I know essentially 0 about DFAs. However, I noticed that your
"well-documented Python library" contained no examples at all
and no references to the literature, except for the blurb:

   """...
   See "Minimal cover-automata for finite languages" for context
on DFCAs, and
"An O(n^2) Algorithm for Constructing Minimal Cover Automata
for Finite Languages"
for the source of this algorithm (Campeanu, Paun, Santean, and
Yu). We follow their
algorithm exactly, except that "l" is optionally calculated
for you, and the state-
ordering is automatically created.

There exists a faster, O(n*logn)-time algorithm due to Korner,
from CIAA 2002.
 ...
"""

I'd be happier to see
(1) some examples and
(2) specific detailed references like:
"For all DFA terms, we use Michael Sipser, Introduction to the Theory
of Computation. PWS, Boston. 1997"
or something like that.

A comparison with what is out there already (and open source, of
course) would be
very helpful.

Just my 2cents. It would be much better if someone who was more expert
on this commented though.


On Jan 10, 2008 9:04 PM, ab <[EMAIL PROTECTED]> wrote:
>
> I'd be interested in having code from my Python DFA (Deterministic
> Finite Automaton) package included in SAGE, as I saw that it doesn't
> seem to have one yet. You can find the project at 
> http://code.google.com/p/python-automata/
> (svn version of code recommended). Would it be a good fit? What's the
> process?
>
> Andrew
>
> >
>

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Block matrices?

2008-01-10 Thread Robert Bradshaw

On Jan 10, 2008, at 11:19 AM, William Stein wrote:

> On Jan 10, 2008 9:16 AM, Robert Bradshaw  
> <[EMAIL PROTECTED]> wrote:
>>
>> These sound like good suggestions, I'll re-implement the richer
>> functionality.
>>
>
> Quick question -- why does  this even have to be another function?  
> Couldn't
> we just expand the functionality of the matrix command, at least in  
> some
> cases?  That's how some other systems work.
>
> E.g., if A, B, C, D are all matrices of the same size, we could make
>
>matrix([[A,B], [C, D]])
>
> (1) determine a ring that the base rings of A,B,C,D all map to, then
> (2) make the block matrix as mentioned above.   We would know to
> do this because A,B,C,D are all of type MatrixElement and  
> MatrixElements
> are not ring elements.  (Issue: Square matrices could someday be  
> ring elements
> but they aren't now.)
>
> For clarity we could have a disambuiguation, e.g.,
> matrix([..], block=True)
>
> Anyway, to implement this would mean implementing exactly what you
> plan to do already with a block_matrix command, then just adding a
> quick hook to matrix(...) when one would otherwise get an error.

See http://sagetrac.org/sage_trac/ticket/1732 for a more flexible  
block_matrix command.

Hooking this up to matrix(...) is now http://sagetrac.org/sage_trac/ 
ticket/1755

- Robert


--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] DFA package for inclusion

2008-01-10 Thread ab

I'd be interested in having code from my Python DFA (Deterministic
Finite Automaton) package included in SAGE, as I saw that it doesn't
seem to have one yet. You can find the project at 
http://code.google.com/p/python-automata/
(svn version of code recommended). Would it be a good fit? What's the
process?

Andrew

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Wiris -- something like the Sage notebook sort of

2008-01-10 Thread Ted Kosan

Robert wrote:

> What is unfinished about it? Just because the author had/has more
> plans for it doesn't mean it isn't very useable now (more so, I would
> argue, than a drag-n-drop interface).

Mouse positioning of the cursor, cut and paste, multiple fonts, font
resizing, multiple equations on one "sheet" of paper, 2D plotting, 3D
plotting, tabbed panes, etc.  Moving on to DragMath's capabilities:
load and save to disk, multi-language support, export to LaTeX,
MathML, Maple, and Maxima along with the ability to add additional
export formats (like Sage) by editing an XML-based configuration file.

I know what Java can do and I have posted demo code which illustrates
it running in the notebook.  Now I want to see what Javascript is
capable of because almost everything GUI-related I have seen which is
written in Javascript seems unfinished to me when compared to Java GUI
stuff.  From what I have seen so far, Javascript is simply incapable
of coming anywhere close to what Java can do.  If it can, I would love
to see actual running examples like I have been providing :-)

Going back to the initial post in this thread, the  Wiris people
"...ended the discussion by telling us that their web-based interface
is (going to be) much better than ours."  I don't think they arrived
at this conclusion by thinking that William and Tom were substandard
programmers (which is obviously not the case).  I think they looked at
the Sage notebook and concluded they could have written an equivalent
in Java with something like NetBeans in a day or two.

Anyway, since I am one of the few Java developers on this list (and
since I was mentioned by name in the original post) I felt it was my
duty to provide arguments for the Java-side of this discussion.  I
have done this to my satisfaction :-)

Ted

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] SCREMS proposal

2008-01-10 Thread William Stein

Hi,

The Screms proposal is now completely done, but it's possible for me
to make some last minute minor
typo fixes tomorrow morning.  I've posted the latest version here:
http://wstein.org/grants/screms/

If you notice _any_ typos or mistakes at all, definitely let me know.
The proposal is supposed
to be perfect right now.

  -- william

-- 
William Stein
Associate Professor of Mathematics
University of Washington
http://wstein.org

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Anyone knows about any regression in gmp-4.2.2?

2008-01-10 Thread Soroosh Yazdani
Hi,

I'm actually really excited that you've got as far. Do you have an ebuild
that I can try?

Cheers,
Soroosh

On Jan 8, 2008 1:40 PM, Francois <[EMAIL PROTECTED]> wrote:

>
>
>
> On Jan 8, 11:55 pm, mabshoff <[EMAIL PROTECTED]
> dortmund.de> wrote:
> > On Jan 8, 10:00 am, Francois <[EMAIL PROTECTED]> wrote:
> >
> > > Hi,
> >
> > Hi Francois,
> >
> >
> >
> > > In my efforts to get sage in Gentoo I came on something that looks
> > > like a problem in gmp 4.2.2.
> > > On Gentoo gmp 4.2.2 is marked stable and is part of the system (needed
> > > by gcc). On the ground
> > > that the only patch relevant to me was the new fast gcd code and that
> > > it was a performance patch
> > > and not a correctness one, I decided to use my system gmp (along with
> > > bzip2, readline, mpfr,gd,
> > > pari [mistake since the Galois data are not included in Gentoo],
> > > gnutls, atlas [oh yes not another
> > > 5 hours of tunning, please] and maxima - I passed on python for now).
> >
> > > Having a successful build after rather minimal adjustment I decided to
> > > test it
> > > (sage -testall) and compare the results with a regular build. Numerous
> > > failures at
> > > various point. First tut.tex:
> > > sage -t  tut.tex
> > > ***
> > > ***
> > > File "tut.py", line 1126:
> > > : x = crt(2, 1, 3, 5); x
> > > Expected:
> > > 11
> > > Got:
> > > -4
> > > **
> > > File "tut.py", line 2250:
> > > : M.T(11).charpoly('x').factor()
> > > Expected:
> > > (x - 285311670612) * (x - 534612)^2
> > > Got:
> > > x^3 - 732255212432452092*x^2 + 732255211931384496*x -
> > > 3145012477679296873951599424
> > > **
> > > 2 items had failures:
> > >1 of   8 in __main__.example_48
> > >1 of   8 in __main__.example_96
> > > ***Test Failed*** 2 failures.
> > > For whitespace errors, see the file .doctest_tut.tex
> > >  [60.2 s]
> > > exit code: 256
> >
> > > and then a few more. For the first failed test putting back gmp/mpfr
> > > in the build
> > > solved the problem for the second putting back pari worked [of course
> > > system
> > > pari was built against system gmp so it probably propagated from
> > > there]. That
> > > solved almost all the failed test I had (the test didn't finish got
> > > stuck in calc.py
> > > if memory serves me correctly).
> >
> > The system's Maxima ought to be at fault here.
> >
> > > I checked that gmp was built properly with the "make check" provided
> > > in gmp,
> > > so it doesn't look like a miscompilation.
> >
> > You may have hithttp://trac.sagemath.org/sage_trac/ticket/1482since
> > the system gmp didn't have the improved gcd code patched in. The
> > default behavior is not to pass the parameter "minimal", so the issues
> > you see won't be fixed if you use a non-patched gmp. For many people
> > patching the gmp with a GPLed patch making the derived work GPL only
> > will be a problem since many distributions ship code that depends on
> > GPL being LGPL.
> >
> > > I guess it should be investigated before this version of gmp makes it
> > > into sage
> >
> > I am confident it will be resolved. The changes gmp 4.2.1->4.2.2 were
> > largely config fixes and fixes for exotic platforms, so I don't expect
> > any problems once we remerge our patch set.
> >
> I didn't know about that "minimal" parameter - I made the assumption
> that
> the interfacing wouldn't be changed for a minor version, I can
> understand
> as John Cremona that in fact the test I show is correct. I am more
> shocked
> at the behavior of pari I don't know if it is to be expected with an
> unpatched
> gmp. I may try to patch my system gmp and see what happens with that.
>
> I am sure that system maxima is at fault. I just like to know where it
> originates
> from. mpfr? (I realised recently fentoo use 2.3.0.p3 not p4 - it is in
> portage but in
> unstable probably no one care enough to stabilize it fast) lisp? The
> default
> lisp for maxima here is the "Steel Bank Common Lisp" and is not
> callable
> from sage, I got hit by http://trac.sagemath.org/sage_trac/ticket/1002
> (or http://bugs.gentoo.org/show_bug.cgi?id=54738 ), gcl fails I had to
> use
> CMU common lisp. Something else?
>
> Did you open http://trac.sagemath.org/sage_trac/ticket/1721
> because of my remark on atlas? It has to come with a warning to set
> SAGE_FORTRAN as well.
> >
>

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Wiris -- something like the Sage notebook sort of

2008-01-10 Thread Robert Bradshaw

On Jan 10, 2008, at 4:14 PM, Ted Kosan wrote:

> Tom wrote:
>
>> This is a very nice start.
>
> But the original discussion was about Javascript vs. Java as a
> technology for enhancing the notebook.  I think that Wiris provides a
> good example of what Java is capable of in this area but it would be
> unfair to compare the Javascript equation editor to Wiris CAS since
> the Javascript one is unfinished (I like what it can do so far
> though).   Has anyone been able to find a finished Javascript-based
> equation editor that can be used for an apples-to-apples comparison
> with Wiris CAS?

What is unfinished about it? Just because the author had/has more  
plans for it doesn't mean it isn't very useable now (more so, I would  
argue, than a drag-n-drop interface).

- Robert

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Wiris -- something like the Sage notebook sort of

2008-01-10 Thread Ted Kosan

Tom wrote:

>This is a very nice start.

But the original discussion was about Javascript vs. Java as a
technology for enhancing the notebook.  I think that Wiris provides a
good example of what Java is capable of in this area but it would be
unfair to compare the Javascript equation editor to Wiris CAS since
the Javascript one is unfinished (I like what it can do so far
though).   Has anyone been able to find a finished Javascript-based
equation editor that can be used for an apples-to-apples comparison
with Wiris CAS?

Ted

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Wiris -- something like the Sage notebook sort of

2008-01-10 Thread boothby

*wow*

This definately has some little issues that I don't like (for example, typing 
"in", which you might want to be the product i*n), but this looks good and 
works very well.  Also, it's very fast.

For the record: I will *never* use any interface that requires me to use the 
mouse for non-trivial input, except for paint programs (well... I guess, if 
somebody wanted to pay me $100 and hour to do so...), and I won't inflict such 
interfaces on others.  DragMath is a dead end, in my mind.  This is a very nice 
start.


On Wed, 9 Jan 2008, William Stein wrote:

>
> On Jan 9, 2008 2:35 PM, Justin C. Walker <[EMAIL PROTECTED]> wrote:
>>
>>
>> On Jan 9, 2008, at 10:43 AM, Ted Kosan wrote:
>>
>>>
>>> Tom wrote:
>>>
 Excellent idea, Ted.  I took your idea, expanded upon it, and
 added standard scalable development concepts to accelerate the
 synergy of the web service protocols you've proposed.

 http://sage.math.washington.edu/home/boothby/
 web_service_architecture_joke.png

 (tongue firmly in cheek)
>>>
>>> That's quite funny :-)
>>>
>>> Anyway, in about the same amount of time it took you to put that
>>> together, I got a graphic equation editor working in the notebook.
>>> Just execute the following code in a notebook cell for a
>>> demonstration:
>>>
>>> html('>> width="540" height="322"\
>>> archive="Project.jar,AbsoluteLayout.jar,swing-
>>> layout-1.0.jar,jdom.jar,jep.jar"\
>>> code="Display.MainApplet.class"\
>>> codebase="http://sage.math.washington.edu/home/tkosan/mathrider/
>>> DragMath/applet/classes"\
>>> name="DragMath">\
>>> MAYSCRIPT ')
>>
>> Maybe it's just that my system senses my inate hostility to Java, but
>> this doesn't seem to work well for me (Mac OS X, 10.4.11, Safari 3
>> Public Beta, whatever version of Java I have).
>>
>> I pasted the above snippit into the notebook, and evaluated it,
>> giving me a sort of Java-looking subwindow.  I could type a few
>> things, but after I started clicking on icons, the interface ground
>> to a halt, and icons got repainted in the wrong places as I clicked.
>>
>> Java: write once, run occasionally.  :-}
>
> Since we're comparing Java to Javascript for the purposes of an equation 
> editor,
> I did a quick google search and found that the author of jsmath wrote
> a javascript
> equation editor.  Please try it out:
>
>http://www.math.union.edu/~dpvc/talks/2006-12-08.IMA/editor.html
>
> It uses jsmath to implement an equation editor.Lets see how many
> people have trouble using this and how many don't, and what you think
> of how it looks.
>
> -- william
>
> >
>



--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Creating an SRPM

2008-01-10 Thread mabshoff



On Jan 10, 10:34 pm, gri6507 <[EMAIL PROTECTED]> wrote:
> > Well, you can skip the build by modifying $SAGE_ROOT/spkg/standard/
> > deps, but the recommended way would be to add you scripts/config file
> > to the spkgs themselves. For example we fixed a bug yesterday in ATLAS
> > that causes compile time on Pentium M to be very, very excessive. That
> > patch has been posted to the ATLAS bug tracker, but not merged yet. So
> > far there hasn't been any reaction :(
>
> I'm not sure what you mean by "the recommended way would be to add you
> scripts/config file to the spkgs themselves". Can you please clarify.

Could you post an example for a the files/configuration you use to
create the srpm?

> > Open a thread there. Get a trac account and open ticket there with
> > patches once they have been discussed here. For a trac account contact
> > me offlist. You should send me a non-funny account name (gri6507 is
> > considered funny) and a password.
>
> It's in the mail

Ok, I see that you added two ticket, so everything seems to work.

Cheers,

Michael
--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Block matrices?

2008-01-10 Thread Harald Schilly

On Jan 10, 10:41 pm, Nick Alexander <[EMAIL PROTECTED]> wrote:
> That may be true, but this function is already so overloaded that
> understanding the code is very difficult.

well, what if there are both functions and matrix just calls
block_matrix if there are matrix objects in the list of arguments?
i don't think code complexity is an issue there, since you can
encapsulate all functionality in methods and at last, one of the main
ideas behind object oriented programming with class hierarchies is
that functions look the same but behave different depending on the
object.

from my point of view it is always more important to think of user
friendliness (means less but more intelligent functions .. you can see
this in the first posting, where this proposed extension is a logical
"try-and-error" generalization to the current matrix command) and not
of coding friendliness ;)

> As for replicating the matrix to make
> it fit, that's a terrible idea: hooray for difficult to diagnose bugs
> and confusing semantics.

this should be discussed. for example there could be a safeguard: like
a parameter 'replicate' with default value 'none'. then nothing
happens, just an error message. it could be easily extended in the
future by implementing replication methods ('diagonal', 'full', 'upper-
triangle','band3',...)
then there is no problem with unintended automatic behaviour and all
extensions are backwards compatible.

H
--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: inner product of complex vectors

2008-01-10 Thread John Cremona

That all sounds very sensible to me.

Why don't you make a trac with most of your previous email in it?
I'll be busy with other matters but am happy to have more ideas
bounced off me.

John

On 10/01/2008, David Kohel <[EMAIL PROTECTED]> wrote:
>
> Dear John (et
> al.),
>
> I think the inner product should be the same irrespective of the
> field.
>
> The inner product as dot product is relevant to the study of
> quadratic
> forms, conics, and orthogonal groups.  For instance finding a
> rational
> point on the conic x^2 + y^2 + z^2 = 0 over CC is equivalent to
> a
> representation of zero of the quadratic form, but not if the form
> is
> replaced by x\bar{x} + y\bar{y} + z\bar{z}, and I don't think we
> want
> to break this correspondence between points on conics and
> isotropic
> vectors.
>
> What is missing is a class for Hermitian modules, which would
> have
> a ring with involution as base ring.  Such a class would be useful
> for
> studying Riemannian lattices such as the period lattice of an
> abelian
> variety, and unimodular groups.  This class would allow one to
> define
> the Hermitian inner product x\bar{x} + y\bar{y} + z\bar{z} on a
> ring
> with inner product x |->
> \bar{x}.
>
> One choice of inner product is not sufficient to represent all such
> forms,
> and defining the default inner product to be the Hermitian product
> for
> complex fields would require making similar definition for
> imaginary
> quadratic fields, cyclotomic fields, and other CM fields for
> consistency.
> Even recognition of a CM field is nontrivial and this would lead
> to
> arbitrary choices.  Worse, for other number fields, a Hermitian
> product
> would depend on a particular choice of
> embedding.
>
> So if this is entered into a trac, I think it should be for creation
> of a class
> of Hermitian forms together with a class of rings with involution
> (from
> which CC, quadratic rings, cyclotomic rings, and a class of CM
> fields
> would
> inherit).
>
> --
> David
> >
>


-- 
John Cremona

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Notebook revision info leakage

2008-01-10 Thread William Stein

On Jan 10, 2008 12:36 PM, Nils Bruin <[EMAIL PROTECTED]> wrote:
>
> I posted
> http://sagetrac.org/sage_trac/ticket/1751
> In general, the incredible persistence of the notebook is great.
> However, it makes "deleting" things a rather opaque procedure and it
> is not entirely clear to me what to do to make sure that notebook
> information has been properly deleted.

Nils,

I implemented the bare minimum features needed for the notebook to work
for SIMUW last summer.  Deleting wasn't part of this bare minimum.  I definitely
want to implement (or have implemented) all the additional things you are
suggesting regarding deleting, etc.

You can temporarily work around deleting history as follows:
   (a) you could copy the worksheet to a new one (by using the edit
mode and copying
the plane text) before publishing, or

   (b) delete the "old revisions" files themselves, which are just a
bunch of bzip2'd text
files in the worksheet data directory.

 -- William

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Block matrices?

2008-01-10 Thread Nick Alexander


On 10-Jan-08, at 11:44 AM, Harald Schilly wrote:

>
> On Jan 10, 8:19 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
>> On Jan 10, 2008 9:16 AM, Robert Bradshaw  
>> <[EMAIL PROTECTED]> wrote:
>>> These sound like good suggestions, I'll re-implement the richer
>>> functionality.
>>
>> Quick question -- why does  this even have to be another function?
>
> Hi, just my 2 cents, extending the matrix-creation command is far
> better, because you just think this way.

That may be true, but this function is already so overloaded that  
understanding the code is very difficult.  I think that making matrix 
(...) accept more inputs will hide errors and hide intention; I vote  
for block_matrix and friends.  As for replicating the matrix to make  
it fit, that's a terrible idea: hooray for difficult to diagnose bugs  
and confusing semantics.

Nick

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Creating an SRPM

2008-01-10 Thread gri6507

> Well, you can skip the build by modifying $SAGE_ROOT/spkg/standard/
> deps, but the recommended way would be to add you scripts/config file
> to the spkgs themselves. For example we fixed a bug yesterday in ATLAS
> that causes compile time on Pentium M to be very, very excessive. That
> patch has been posted to the ATLAS bug tracker, but not merged yet. So
> far there hasn't been any reaction :(

I'm not sure what you mean by "the recommended way would be to add you
scripts/config file to the spkgs themselves". Can you please clarify.

> Open a thread there. Get a trac account and open ticket there with
> patches once they have been discussed here. For a trac account contact
> me offlist. You should send me a non-funny account name (gri6507 is
> considered funny) and a password.

It's in the mail
--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Notebook revision info leakage

2008-01-10 Thread Nils Bruin

I posted
http://sagetrac.org/sage_trac/ticket/1751
In general, the incredible persistence of the notebook is great.
However, it makes "deleting" things a rather opaque procedure and it
is not entirely clear to me what to do to make sure that notebook
information has been properly deleted.
--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Creating an SRPM

2008-01-10 Thread mabshoff



On Jan 10, 9:15 pm, gri6507 <[EMAIL PROTECTED]> wrote:

Hi gri6507,

> A while ago I posted in this forum with a problem regarding my efforts
> on creating an SRPM. At the time, I was told that even though there
> was no such entity, there was some work being done on a DEB package
> and that I should definitely continue my efforts.

Sure, I assume you mean individual srpms.

> Well, I am pretty close to the finishing it off (if anyone would like
> to see it, please let me know). In the mean time, I was wondering if I
> could clean it up a bit. One thing that I noticed is that the standard
> "make" process builds everything under the sun (that's why the
> distributable sage-version.tar file is so large). Well, as it turns
> out, over the course of time, I had already created standalone SRPMs
> for lapack, blas, atlas, etc - the list goes on. So, I was wondering
> what kind of changes would I have to do to my make process in order
> for SAGE to detect my existing installations of those libraries?

Well, you can skip the build by modifying $SAGE_ROOT/spkg/standard/
deps, but the recommended way would be to add you scripts/config file
to the spkgs themselves. For example we fixed a bug yesterday in ATLAS
that causes compile time on Pentium M to be very, very excessive. That
patch has been posted to the ATLAS bug tracker, but not merged yet. So
far there hasn't been any reaction :(

> Thanks in advance,
> Paul.

Thanks for your efforts, we need to make more progress on packaging
Sage for distributions. I assume that we could run an extra rpm repo
with all the packages that haven't made it into FC for example yet.

> P.S. I noticed that the "make install" is still experimental. There
> are a couple of things that I would recommend changing there. How do i
> go about submitting those comments?

Open a thread there. Get a trac account and open ticket there with
patches once they have been discussed here. For a trac account contact
me offlist. You should send me a non-funny account name (gri6507 is
considered funny) and a password.

Cheers,

Michael
--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Creating an SRPM

2008-01-10 Thread gri6507

A while ago I posted in this forum with a problem regarding my efforts
on creating an SRPM. At the time, I was told that even though there
was no such entity, there was some work being done on a DEB package
and that I should definitely continue my efforts.

Well, I am pretty close to the finishing it off (if anyone would like
to see it, please let me know). In the mean time, I was wondering if I
could clean it up a bit. One thing that I noticed is that the standard
"make" process builds everything under the sun (that's why the
distributable sage-version.tar file is so large). Well, as it turns
out, over the course of time, I had already created standalone SRPMs
for lapack, blas, atlas, etc - the list goes on. So, I was wondering
what kind of changes would I have to do to my make process in order
for SAGE to detect my existing installations of those libraries?

Thanks in advance,
Paul.

P.S. I noticed that the "make install" is still experimental. There
are a couple of things that I would recommend changing there. How do i
go about submitting those comments?

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: loading integer or float data from file into a matrix

2008-01-10 Thread Harald Schilly

On Jan 10, 5:42 pm, myFalc <[EMAIL PROTECTED]> wrote:

> At the moment I'm trying to load a file into sage and put its data
> into a matrix.

a more general question, at the top of the sage notebook on the left
is the "data" dropdown menu. what exactly does  it? also including a
matrix or just a general file? where is this documented or just not
implemented so far?

h
--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Block matrices?

2008-01-10 Thread Harald Schilly

On Jan 10, 8:19 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Jan 10, 2008 9:16 AM, Robert Bradshaw <[EMAIL PROTECTED]> wrote:
> > These sound like good suggestions, I'll re-implement the richer
> > functionality.
>
> Quick question -- why does  this even have to be another function?

Hi, just my 2 cents, extending the matrix-creation command is far
better, because you just think this way. I would suggest even more
(from the practical point of view)
my ideas:

1. check if the matrices are compatible

2. not just 2x2, every possibility matrix-blocks. e.g. [A,B,A,B] or
[[A,B,C],[B,B,C]] should work too.

3. If those blocks don't have equal dimensions, try if the smaller
dimensions divide the biggest one. if true, then either repeat the
smaller block or repeat it on the diagonal; if not true, error.
diagonal means, if A is 4x4 and B 2x2:
[A,B] = [A, identity-matrix(2)  B]
not diagonal:
[A,B] = [A, ones(2)  B]

4. if there is a mixture of matrices and numbers (elements of those
matrices) interpret them as 1x1 matrices.
e.g. if A is 4x4 and the diagonal switch is turned on:
[A,3] = [A, identity(4) * 3]

i think something in this direction could be very useful. also
extending the repeat-layout to upper/lower triangles, band-diagonals
(upper,lower,both sides) could be nice, too.

H
--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Block matrices?

2008-01-10 Thread William Stein

On Jan 10, 2008 9:16 AM, Robert Bradshaw <[EMAIL PROTECTED]> wrote:
>
> These sound like good suggestions, I'll re-implement the richer
> functionality.
>

Quick question -- why does  this even have to be another function? Couldn't
we just expand the functionality of the matrix command, at least in some
cases?  That's how some other systems work.

E.g., if A, B, C, D are all matrices of the same size, we could make

   matrix([[A,B], [C, D]])

(1) determine a ring that the base rings of A,B,C,D all map to, then
(2) make the block matrix as mentioned above.   We would know to
do this because A,B,C,D are all of type MatrixElement and MatrixElements
are not ring elements.  (Issue: Square matrices could someday be ring elements
but they aren't now.)

For clarity we could have a disambuiguation, e.g.,
matrix([..], block=True)

Anyway, to implement this would mean implementing exactly what you
plan to do already with a block_matrix command, then just adding a
quick hook to matrix(...) when one would otherwise get an error.

William

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: loading integer or float data from file into a matrix

2008-01-10 Thread Fernando Perez

On Jan 10, 2008 10:59 AM,  <[EMAIL PROTECTED]> wrote:
>
> numpy saves the day.
>
> import numpy
> A = numpy.loadtxt('foo.data')  #A is a float array
> B = M.astype(int)  #B is an int array
>
> M = Matrix(RDF, list(A))   #M is a RDF matrix
> N = Matrix(ZZ, list(B))#N is an Integer matrix

Note that numpy arrays also have a .tolist() method, with 'smarter'
unpacking behavior:

In [16]: a = zeros((2,3))

In [17]: list(a)
Out[17]: [array([ 0.,  0.,  0.]), array([ 0.,  0.,  0.])]

In [18]: a.tolist()
Out[18]: [[0.0, 0.0, 0.0], [0.0, 0.0, 0.0]]

It may be useful for some cases.

Cheers,

f

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: loading integer or float data from file into a matrix

2008-01-10 Thread boothby

numpy saves the day.

import numpy
A = numpy.loadtxt('foo.data')  #A is a float array
B = M.astype(int)  #B is an int array

M = Matrix(RDF, list(A))   #M is a RDF matrix
N = Matrix(ZZ, list(B))#N is an Integer matrix



On Thu, 10 Jan 2008, David Roe wrote:

> One way to do it is to use the Python functions on strings.  For example, if
> you want to use the real double field (RDF) and matrix_data is your string,
> the following should do what you want:
> M = matrix(RDF, [b.split() for b in matrix_data.split('\n')])
>
> The split method of a string creates a list of substrings that are separated
> by a given separator, and the default separator is whitespace.
> See the documentation on RDF to see if you want to use that, or RR or
> something else.
> David
>
> On Jan 10, 2008 11:42 AM, myFalc <[EMAIL PROTECTED]> wrote:
>
>>
>> Hello!
>> I'm new to sage and I already searched for a solution on the web, but
>> couldn't find any.
>> At the moment I'm trying to load a file into sage and put its data
>> into a matrix. The file spans a matrix of thousands of float values.
>> columns separated by whitespaces and rows separated by newlines.
>> I was able to load the data into a string(or list) but i couldn't find
>> out how to put the data into a matrix.
>> e.g. M = Matrix(10,2,(string)) is not working.
>> anyone with ideas or solutions?
>>
>> i used octave before, and it worked really easy there. unfortunately i
>> can't use the octave load commands in sage since there are semicolons
>> needed for the command which result in a syntax error.
>>
>> greetings
>> markus
>>
>>>
>>
>
> >
>



--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Sage 2.10.alpha1 released

2008-01-10 Thread Jaap Spies

mabshoff wrote:
> 
> 
> On Jan 10, 4:18 pm, Jaap Spies <[EMAIL PROTECTED]> wrote:
>> mabshoff wrote:

>> The following tests failed:
>>
>>  sage -t  
>> devel/sage-main/sage/rings/polynomial/polynomial_element.pyx
> 
> Please apply the patch attached to #1749 and report back.
> 

Works for me, on FC8 too.

Jaap


--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Block matrices?

2008-01-10 Thread Robert Bradshaw

These sound like good suggestions, I'll re-implement the richer  
functionality.

On Jan 10, 2008, at 7:50 AM, didier deshommes wrote:

>
> On Jan 9, 2008 3:23 AM, Robert Bradshaw  
> <[EMAIL PROTECTED]> wrote:
>>
>> http://sagetrac.org/sage_trac/ticket/1732
>
> 2 questions about the patch:
> * Why is this function named block_sum? What are we summing?
> * Why are we limited to 4 arguments? Ideally, I would love to pass a
> list to this function and have it concatenate each matrix in the list
> (horizontally in the following case):
> A.block_matrix([A_1, A_2, ..., A_n])
>
> You could pass the functions an argument, indicating the number of
> rows (or columns) you want so that you can do things like
> A =  [ A1 A2]
> [ A3 A4]
>
> like this:
> A=block_matrix([A1,A2,A3,A4],num_cols=2*3,num_rows=None). Here each A
> is 3x3 and we are concatenating 2 of them in each row.
>
> On a more general note, block_sum as of 2.9.3 is really constructing a
> block diagonal matrix, isn't it? Why not call it block_diagonal? Of
> course, for now, it's only using one argument, why not pass it a list
> of matrices?
>
> Thoughts?
>
> didier
>
>>
>>
>> On Jan 8, 2008, at 4:27 AM, vgermrk wrote:
>>
>>>
>>> Is there a way to construct block matrices in SAGE?
>>> Not just the "block_sum", "augment" and "stack" functions.
>>>
>>> As an example, let A, B, C, D be matrices and i want to construct a
>>> matrix like E=[[A,B],[C,D]]
>>>
>>> Such a feature would be very nice.
>>>
>>> -vgermrk-
>>>
>>
>>>
>>
>
> 

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Block matrices?

2008-01-10 Thread David Joyner

I agree with Didier's comments.
Judging from emails to the GAP support list
(Which also has such a function), a block matrix function will be
frequently used.
I think it should be well-documented.


On 1/10/08, didier deshommes <[EMAIL PROTECTED]> wrote:
>
> On Jan 9, 2008 3:23 AM, Robert Bradshaw <[EMAIL PROTECTED]>
> wrote:
> >
> > http://sagetrac.org/sage_trac/ticket/1732
>
> 2 questions about the patch:
> * Why is this function named block_sum? What are we summing?
> * Why are we limited to 4 arguments? Ideally, I would love to pass a
> list to this function and have it concatenate each matrix in the list
> (horizontally in the following case):
> A.block_matrix([A_1, A_2, ..., A_n])
>
> You could pass the functions an argument, indicating the number of
> rows (or columns) you want so that you can do things like
> A =  [ A1 A2]
> [ A3 A4]
>
> like this:
> A=block_matrix([A1,A2,A3,A4],num_cols=2*3,num_rows=None). Here each A
> is 3x3 and we are concatenating 2 of them in each row.
>
> On a more general note, block_sum as of 2.9.3 is really constructing a
> block diagonal matrix, isn't it? Why not call it block_diagonal? Of
> course, for now, it's only using one argument, why not pass it a list
> of matrices?
>
> Thoughts?
>
> didier
>
> >
> >
> > On Jan 8, 2008, at 4:27 AM, vgermrk wrote:
> >
> > >
> > > Is there a way to construct block matrices in SAGE?
> > > Not just the "block_sum", "augment" and "stack" functions.
> > >
> > > As an example, let A, B, C, D be matrices and i want to construct a
> > > matrix like E=[[A,B],[C,D]]
> > >
> > > Such a feature would be very nice.
> > >
> > > -vgermrk-
> > >
> >
> > >
> >
>
> >
>

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: loading integer or float data from file into a matrix

2008-01-10 Thread David Roe
One way to do it is to use the Python functions on strings.  For example, if
you want to use the real double field (RDF) and matrix_data is your string,
the following should do what you want:
M = matrix(RDF, [b.split() for b in matrix_data.split('\n')])

The split method of a string creates a list of substrings that are separated
by a given separator, and the default separator is whitespace.
See the documentation on RDF to see if you want to use that, or RR or
something else.
David

On Jan 10, 2008 11:42 AM, myFalc <[EMAIL PROTECTED]> wrote:

>
> Hello!
> I'm new to sage and I already searched for a solution on the web, but
> couldn't find any.
> At the moment I'm trying to load a file into sage and put its data
> into a matrix. The file spans a matrix of thousands of float values.
> columns separated by whitespaces and rows separated by newlines.
> I was able to load the data into a string(or list) but i couldn't find
> out how to put the data into a matrix.
> e.g. M = Matrix(10,2,(string)) is not working.
> anyone with ideas or solutions?
>
> i used octave before, and it worked really easy there. unfortunately i
> can't use the octave load commands in sage since there are semicolons
> needed for the command which result in a syntax error.
>
> greetings
> markus
>
> >
>

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] loading integer or float data from file into a matrix

2008-01-10 Thread myFalc

Hello!
I'm new to sage and I already searched for a solution on the web, but
couldn't find any.
At the moment I'm trying to load a file into sage and put its data
into a matrix. The file spans a matrix of thousands of float values.
columns separated by whitespaces and rows separated by newlines.
I was able to load the data into a string(or list) but i couldn't find
out how to put the data into a matrix.
e.g. M = Matrix(10,2,(string)) is not working.
anyone with ideas or solutions?

i used octave before, and it worked really easy there. unfortunately i
can't use the octave load commands in sage since there are semicolons
needed for the command which result in a syntax error.

greetings
markus

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Sage 2.10.alpha1 released

2008-01-10 Thread mabshoff



On Jan 10, 4:18 pm, Jaap Spies <[EMAIL PROTECTED]> wrote:
> mabshoff wrote:
> > Hi,

Hi Jaap,

> > Sage 2.10.alpha1 has been release. I guess the highlight is the
> > Pentium M takes forever to compile fix by Paul Zimmermann. Josh
> > and I also updated numpy and there was a whole bunch of patches
> > that fix some long standing issues. More details are below.
>
> > Tarball [197MB] is at
>
> >http://sage.math.washington.edu/home/mabshoff/release-cycles-2.10/sag...
>
> > I will write a separate email about the tickets that need reviews
> > shortly.
>
> > Cheers,
>
> > Michael
>
> > Known Problems:
>
> On Fedora 7 one failure, probably easy to fix:

Yep


> The following tests failed:
>
>  sage -t  devel/sage-main/sage/rings/polynomial/polynomial_element.pyx

Please apply the patch attached to #1749 and report back.

> Jaap

Cheers,

Michael
--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Enthought mayavi2 as a library

2008-01-10 Thread Jaap Spies

Fernando Perez wrote:
> Howdy,
> 
> On Jan 8, 2008 10:43 AM, mabshoff
> <[EMAIL PROTECTED]> wrote:
> 
>> Ok, the culprit points to a cleanup function of m4ri, which under
>> normal conditions is called only once. I am not seeing the above issue
>> under valgrdind with "pure" Sage 2.10.alpha0, but as I just learned
>> yesterday problematic free() calls might be hidden by other bugs.
>> Imagine my surprise that once I fixed #1092 or #1093 some invalid free
>> popped up. We currently have a problem in tp_new (see #1337) which is
>> the only culprit on our end that could hide that. But the question
>> remains if IPython does something funny with threads and somehow
>> triggers more than one cleanup call. We could add some check for NULL
>> inside destroyAllCodes(). So, anybody with a better knowledge of
>> IPython: It seems that threads are involved, so could this somehow be
>> triggered?
> 
> Sorry for the slow reply.  Bit swamped 'round here...
> 
> Yes, the issue is really that I explained myself poorly to Jaap.  He's running
> 
> import IPython
> IPython.Shell.IPShellWX().mainloop()
> 
> Inside an already started Sage session.  But at the exit of that
> mainloop(), ipython will tear down the threading support (absolutely
> necessary for WX to work without blocking the interactive console).
> That mainloop is hooked into the WX event loop, so it can't really be
> restarted.
> 
> The solution is to have Sage start ipython with the wthread option, if
> you want full Sage support.  As a starter, you can test this. Make a
> little file that's simply
> 
> #!/path/to/sage/python
> import IPython
> IPython.Shell.IPShellWX().mainloop()
> 
> 
> make it executable, and run it *standalone* in a sage-sh configured
> shell.  This standalone ipython is equivalent to running
> 
> ipython -wthread
> 
> and will simply exit at the end.  If that works and closes without
> crashing, then someone more familiar than myself with how sage starts
> itself can then offer an option for sage to fire up ipython with
> '-wthread' at startup.  This will ensure that the threads cleanup only
> happens when sage itself exits, not in the middle of the enclosing
> Sage session.
> 

This worked for me!

> My originally incomplete explanation led Jaap to have a main event
> loop inside another one.  That's always bad news.
> 
> I hope this is now clearer.
> 

Thanks!


Jaap


> Cheers,
> 
> f
> 
> > 
> 


--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Block matrices?

2008-01-10 Thread didier deshommes

On Jan 9, 2008 3:23 AM, Robert Bradshaw <[EMAIL PROTECTED]> wrote:
>
> http://sagetrac.org/sage_trac/ticket/1732

2 questions about the patch:
* Why is this function named block_sum? What are we summing?
* Why are we limited to 4 arguments? Ideally, I would love to pass a
list to this function and have it concatenate each matrix in the list
(horizontally in the following case):
A.block_matrix([A_1, A_2, ..., A_n])

You could pass the functions an argument, indicating the number of
rows (or columns) you want so that you can do things like
A =  [ A1 A2]
[ A3 A4]

like this:
A=block_matrix([A1,A2,A3,A4],num_cols=2*3,num_rows=None). Here each A
is 3x3 and we are concatenating 2 of them in each row.

On a more general note, block_sum as of 2.9.3 is really constructing a
block diagonal matrix, isn't it? Why not call it block_diagonal? Of
course, for now, it's only using one argument, why not pass it a list
of matrices?

Thoughts?

didier

>
>
> On Jan 8, 2008, at 4:27 AM, vgermrk wrote:
>
> >
> > Is there a way to construct block matrices in SAGE?
> > Not just the "block_sum", "augment" and "stack" functions.
> >
> > As an example, let A, B, C, D be matrices and i want to construct a
> > matrix like E=[[A,B],[C,D]]
> >
> > Such a feature would be very nice.
> >
> > -vgermrk-
> >
>
> >
>

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Sage 2.10.alpha1 released

2008-01-10 Thread Jaap Spies

mabshoff wrote:
> Hi,
> 
> Sage 2.10.alpha1 has been release. I guess the highlight is the
> Pentium M takes forever to compile fix by Paul Zimmermann. Josh
> and I also updated numpy and there was a whole bunch of patches
> that fix some long standing issues. More details are below.
> 
> Tarball [197MB] is at
> 
> http://sage.math.washington.edu/home/mabshoff/release-cycles-2.10/sage-2.10.alpha1.tar
> 
> I will write a separate email about the tickets that need reviews
> shortly.
> 
> Cheers,
> 
> Michael
> 
> Known Problems:
> 

On Fedora 7 one failure, probably easy to fix:

sage -t  
devel/sage-main/sage/rings/polynomial/polynomial_element.pyx**
File "polynomial_element.pyx", line 2640:
 sage: p.roots(ring=ComplexIntervalField(200))
Expected:
 [([1.1673039782614186842560458998548421807205603715254890391400816 .. 
1.1673039782614186842560458998548421807205603715254890391400829], 1), 
([0.1812326987538390180023778112063996871646618462304743773153 .. 
0.1812326987538390180023778112063996871646618462304743773341] + 
[1.0839541013177106684303444929807665742736402431551156543011306 .. 
1.0839541013177106684303444929807665742736402431551156543011344]*I, 1), 
([0.1812326987538390180023778112063996871646618462304743773153 .. 
0.1812326987538390180023778112063996871646618462304743773341] - 
[1.0839541013177106684303444929807665742736402431551156543011306 .. 
1.0839541013177106684303444929807665742736402431551156543011344]*I, 1), 
([-0.76488443360058472602982318770854173032899665194736756700777454 .. 
-0.76488443360058472602982318770854173032899665194736756700777...] + 
[0.35247154603172624931794709140258105439420648082424733283769... .. 
0.35247154603172624931794709140258105439420648082424733283769...]*I, 1), 
([-0.76488443360058472602982318770854173032899665194736756700777454 .. 
-0.76488443360058472602982318770854173032899665194736756700777204] - 
[0.35247154603172624931794709140258105439420648082424733283769122 .. 
0.35247154603172624931794709140258105439420648082424733283769341]*I, 1)]
Got:
 [([1.1673039782614186842560458998548421807205603715254890391400816 .. 
1.1673039782614186842560458998548421807205603715254890391400829], 1), 
([0.1812326987538390180023778112063996871646618462304743773153 .. 
0.1812326987538390180023778112063996871646618462304743773341] + 
[1.0839541013177106684303444929807665742736402431551156543011306 .. 
1.0839541013177106684303444929807665742736402431551156543011344]*I, 1), 
([0.1812326987538390180023778112063996871646618462304743773153 .. 
0.1812326987538390180023778112063996871646618462304743773341] - 
[1.0839541013177106684303444929807665742736402431551156543011306 .. 
1.0839541013177106684303444929807665742736402431551156543011344]*I, 1), 
([-0.76488443360058472602982318770854173032899665194736756700777454 .. 
-0.76488443360058472602982318770854173032899665194736756700777266] + 
[0.35247154603172624931794709140258105439420648082424733283769153 .. 
0.35247154603172624931794709140258105439420648082424733283769341]*I, 1), 
([-0.76488443360058472602982318770854173032899665194736756700777454 .. 
-0.76488443360058472602982318770854173032899665194736756700777266] - 
[0.35247154603172624931794709140258105439420648082424733283769153 .. 
0.35247154603172624931794709140258105439420648082424733283769341]*I, 1)]
**
1 items had failures:
1 of 109 in __main__.example_58
***Test Failed*** 1 failures.
For whitespace errors, see the file .doctest_polynomial_element.pyx
  [7.7 s]
exit code: 256

--
The following tests failed:


 sage -t  devel/sage-main/sage/rings/polynomial/polynomial_element.pyx

Jaap


--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: inner product of complex vectors

2008-01-10 Thread David Kohel

Dear John (et
al.),

I think the inner product should be the same irrespective of the
field.

The inner product as dot product is relevant to the study of
quadratic
forms, conics, and orthogonal groups.  For instance finding a
rational
point on the conic x^2 + y^2 + z^2 = 0 over CC is equivalent to
a
representation of zero of the quadratic form, but not if the form
is
replaced by x\bar{x} + y\bar{y} + z\bar{z}, and I don't think we
want
to break this correspondence between points on conics and
isotropic
vectors.

What is missing is a class for Hermitian modules, which would
have
a ring with involution as base ring.  Such a class would be useful
for
studying Riemannian lattices such as the period lattice of an
abelian
variety, and unimodular groups.  This class would allow one to
define
the Hermitian inner product x\bar{x} + y\bar{y} + z\bar{z} on a
ring
with inner product x |->
\bar{x}.

One choice of inner product is not sufficient to represent all such
forms,
and defining the default inner product to be the Hermitian product
for
complex fields would require making similar definition for
imaginary
quadratic fields, cyclotomic fields, and other CM fields for
consistency.
Even recognition of a CM field is nontrivial and this would lead
to
arbitrary choices.  Worse, for other number fields, a Hermitian
product
would depend on a particular choice of
embedding.

So if this is entered into a trac, I think it should be for creation
of a class
of Hermitian forms together with a class of rings with involution
(from
which CC, quadratic rings, cyclotomic rings, and a class of CM
fields
would
inherit).

--
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: SCREMS Proposal

2008-01-10 Thread Alex Ghitza

-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1

Hi William,

I'm sending you a bunch of small corrections, mostly minor, but the
kind of thing that might irk grant proposal readers :)

It looks impressive, and I hope it goes through.

Cheers,
Alex


In "Project Summary", third paragraph: "greatly enhancing" should be
"greatly enhance"

Same thing in the second paragraph of "Project Description", first page.

"Project Description":
- - page 1, Introduction, line 3: "computation mention below" should be
"computation mentioned below"
- - page 1, Introduction, line 4: "work done that has" should be "work
that has"
- - page 3, Section 2.1, line 11: "the set of all (of all equivalence
classes) of irreducible" should be "the set of all (equivalence
classes of) irreducible"
- - page 3, Section 2.1, line 15: "motivations for problem" should be
"motivations for this problem"
- - page 4, 2nd paragraph, 2nd sentence: should get rid of one instance
of "in fact" in that sentence (probably the second one is best to
leave out)
- - page 4, 2nd paragraph, last sentence: should get rid of one instance
of "even" (probably the second one)
- - page 5, 2nd paragraph, last sentence: should be replaced by "Thus,
independently of the goals of the Atlas project, it would be of great
interest to compute the KLV polynomials for as many simple complex Lie
groups as possible."
- - page 6, 3rd paragraph, line 7: "as the sets of" should be "as the
set of"
- - page 6, Section 2.2.3, 2nd paragraph, line 6: "computer was to carry
out" should be "computer, which was to carry out"
- - page 6, Section 2.2.3, 3rd paragraph, line 3: "if it ever happen
that" should be "if it ever happened that"
- - page 7, Section 2.3.1, first equation: the exponent "2k" should be "k"
- - page 9, 3rd paragraph, line 4: "Dembelle" should be "Dembele"
- - page 13, 1st line: "is helpful" should be "are helpful"

"Budget Justification":
- - under Student Stipends: "a stipends" should be "a stipend"


William Stein wrote:
> Hi,
>
> In 12 hours I will submit the SCREMS proposal I mentioned a few days
ago, which
> would get us two very nice 128GB 16 x 3Ghz servers.
>
> I've substantially updated the proposal, including a new major section
by the E8
> ATLAS group, actually filling in the budget and summary, etc.  It's here:
>
> http://sage.math.washington.edu/grants/screms
>
> Please let me know about any typos you find, any problems you see with
> the wording, or anything else.   (Note  -- I am aware that several
references
> to papers are not done right now.)
>
> Thanks!
>
> -- William, B. Binegar, M. Rubinstein, C. Doran, R. Miller
>

-BEGIN PGP SIGNATURE-
Version: GnuPG v2.0.7 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org

iD8DBQFHhgmFdZTaNFFPILgRAnDBAJ9UjdD+mwmyauGwJd75FMDb8Xi5KQCdHHIa
XTQ6pdlCLz7Gu7a84ZuaDrw=
=OwhP
-END PGP SIGNATURE-


--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: implausibly old time stamp in optional package gap_packages-4.4.10_2.spkg

2008-01-10 Thread David Joyner

On Jan 10, 2008 1:46 AM, mabshoff
<[EMAIL PROTECTED]> wrote:
>
>
>
> On Jan 9, 8:34 pm, Kate <[EMAIL PROTECTED]> wrote:
> > When using the optional package 'gap_packages-4.4.10_2.spkg',
> > if I do
> >
> >   mv gap_packages-4.4.10_2.spkg  gap_packages-4.4.10_2.tar.bz2
> >   bunzip2  gap_packages-4.4.10_2.tar.bz2
> >   tar xf gap_packages-4.4.10_2.tar
> >
> > then I get
> >
> > tar: gap_packages-4.4.10_2/src/ctbllib/doc: implausibly old time stamp
> > 1969-12-31 19:00:00
> > tar: gap_packages-4.4.10_2/src/ctbllib/tst: implausibly old time stamp
> > 1969-12-31 19:00:00
> > tar: gap_packages-4.4.10_2/src/ctbllib/gap4: implausibly old time
> > stamp 1969-12-31 19:00:00
> > tar: gap_packages-4.4.10_2/src/ctbllib/htm: implausibly old time stamp
> > 1969-12-31 19:00:00
> > tar: gap_packages-4.4.10_2/src/ctbllib/gap3: implausibly old time
> > stamp 1969-12-31 19:00:00
> > tar: gap_packages-4.4.10_2/src/ctbllib/etc: implausibly old time stamp
> > 1969-12-31 19:00:00
> > tar: gap_packages-4.4.10_2/src/ctbllib/data: implausibly old time
> > stamp 1969-12-31 19:00:00
> >
> > So that this does not worry other people  - it worried me! - perhaps
> > these
> > files can be 'touched' and the package rebuilt?


These aren't files - they are directories in Thomas Breuer's character
table library package. In any case, what should I do? Should I inform
Thomas? Would, for example,
1. Unpack the spkg,
2. run touch -r * in the top directory (I don't know if this is even legal),
3. repack,
4. repost the spkg
solve the problem?

I'm leaving for the airport in a few hrs and can do this when I
eventually get to my "home machine".



>
> I agree and hope that David Joyner will fix this soon. This is now
> #1743.
>
> > Kate
>
> Cheers,
>
> Michael
>
> >
>

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: Wiris -- something like the Sage notebook sort of

2008-01-10 Thread pgdoyle



On Jan 8, 11:09 pm, "William Stein" <[EMAIL PROTECTED]> wrote:

> Just to break up the tension in this thread a little bit, here's my
> idea of what it might look like:
>
>http://sage.math.washington.edu/home/was/tmp/architecture_en.jpg

Factoring Sage into a front end communicating with a Sage kernel is a
very natural idea. Mathematica is divided up this way, and that's
where I've borrowed the names `front end' and `kernel' from.  I prefer
`front end' to `notebook server', because the front end could be a
notebook server, or a stand-alone application, or who knows what.  And
I prefer `kernel' to `computation engine', because it's shorter.  I
presume that Wolfram hasn't trademarked these names, or tried to
patent the idea of dividing a system up into front and rear ends.

So, how hard would it be to make this separation?  And (closely
related!) how would you structure communication between the front end
and the kernel?

Cheers,

Peter

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: SCREMS Proposal

2008-01-10 Thread mabshoff



On Jan 10, 11:49 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Jan 10, 2008 2:45 AM, mabshoff
>
>
>
> <[EMAIL PROTECTED]> wrote:
>
> > On Jan 10, 10:37 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> > > Hi,
>
> > > In 12 hours I will submit the SCREMS proposal I mentioned a few days ago, 
> > > which
> > > would get us two very nice 128GB 16 x 3Ghz servers.
>
> > > I've substantially updated the proposal, including a new major section by 
> > > the E8
> > > ATLAS group, actually filling in the budget and summary, etc.  It's here:
>
> > >http://sage.math.washington.edu/grants/screms
>
> > > Please let me know about any typos you find, any problems you see with
> > > the wording, or anything else.   (Note  -- I am aware that several 
> > > references
> > > to papers are not done right now.)
>
> > On the first page of the project description you write: "This computer
> > is the home for Sage (see Section 3), which is by far the most
> > ambitious open source mathematical software development project ever."
>
> > While I think Sage is ambitious I wouldn't call it "by far the most
> > ambitious open source mathematical software development project ever"
> > - and dial that sentence down a little like "a very ambitious open
> > source mathematical software development project". The original
> > sentence sounds a little like the hyperbole Mathematica spreads around
> > that makes me laugh.
>
> I think my brain rotted as a result of being an exhibitor at conference booth
> for the last few days surrounded by ...  you know.  Anyway, how about this
> as an alternative: "\item This computer is the home for Sage (see
> Section~\ref{sage}),
>   which is an open source mathematical software development project."  ?

I think "ambitious" can still be in there.

> > I mean you cannot criticize and laugh about
> > sentences like "Mathematica is the world's most powerful global
> > computation system." [which is complete nonsense and utterly false]
> > and then write the above description of Sage. I might just be overly
> > tired and cranky, so I am catching some sleep now.
>
> Well I can tell you I'm definitely overly tired!

Hehe, I am back to living on PST, so it was a long, long night. But I
will *now* catch some sleep and be back in a couple hours to comment
some more one the proposal (if I find anything)

> William

Cheers,

Michael
--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: SCREMS Proposal

2008-01-10 Thread William Stein

On Jan 10, 2008 2:45 AM, mabshoff
<[EMAIL PROTECTED]> wrote:
>
>
>
> On Jan 10, 10:37 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> > Hi,
> >
> > In 12 hours I will submit the SCREMS proposal I mentioned a few days ago, 
> > which
> > would get us two very nice 128GB 16 x 3Ghz servers.
> >
> > I've substantially updated the proposal, including a new major section by 
> > the E8
> > ATLAS group, actually filling in the budget and summary, etc.  It's here:
> >
> >http://sage.math.washington.edu/grants/screms
> >
> > Please let me know about any typos you find, any problems you see with
> > the wording, or anything else.   (Note  -- I am aware that several 
> > references
> > to papers are not done right now.)
>
> On the first page of the project description you write: "This computer
> is the home for Sage (see Section 3), which is by far the most
> ambitious open source mathematical software development project ever."
>
> While I think Sage is ambitious I wouldn't call it "by far the most
> ambitious open source mathematical software development project ever"
> - and dial that sentence down a little like "a very ambitious open
> source mathematical software development project". The original
> sentence sounds a little like the hyperbole Mathematica spreads around
> that makes me laugh.

I think my brain rotted as a result of being an exhibitor at conference booth
for the last few days surrounded by ...  you know.  Anyway, how about this
as an alternative: "\item This computer is the home for Sage (see
Section~\ref{sage}),
  which is an open source mathematical software development project."  ?

> I mean you cannot criticize and laugh about
> sentences like "Mathematica is the world's most powerful global
> computation system." [which is complete nonsense and utterly false]
> and then write the above description of Sage. I might just be overly
> tired and cranky, so I am catching some sleep now.

Well I can tell you I'm definitely overly tired!

William

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: inner product of complex vectors

2008-01-10 Thread Fabio Tonti
I don't have an answer to Brandon's remark, but John, should this be in
Trac?



On Jan 6, 2008 8:59 PM, [EMAIL PROTECTED] <[EMAIL PROTECTED]>
wrote:

>
> I realize this is a bit naive (and not completely related to the OP)
> but as it currently stands the CC used in sage is essentially a
> subfield of QQ(i).  It may be better to implement RR and CC using
> exact precision (though admittedly this will come at a cost in
> performance) and allow the real field elements to be coerced to
> approximations using mpfr when the user wishes.  Doing so would also
> allow for more straightforward interaction with maxima's solver (the
> default solver in sage), or anything else using
> sage.calculus.calculus.SymbolicArithmetic.
>
> Or is there another reason that the default RR and CC do not use exact
> precision, other than very slight performance issues?  I suspect the
> current reason is that Singular is not equipped to deal with exact
> precision RR and CC.  I'm just curious if this would be a good thing
> in the long run.
>
>
>
> On Jan 6, 11:57 am, "John Cremona" <[EMAIL PROTECTED]> wrote:
> > You are right about the correct inner product definition for complex
> > vectors.  In your first example Sage seems not to be doing any
> > conjugation.
> >
> > RR is real numbers (to some precision) while QQ is rational numbers
> > (which are exact).  If you want complex numbers with real and
> > imaginary parts in QQ that qould be anumber field QQ(i).  But I would
> > not expect Sage to automatically see how to take an inner product of
> > vectors whose entries are in number fields (for which there is no easy
> > answer since number fields in general have both real and complex
> > embeddings).  I doubt if that is what you mean, so that leaves you
> > working with CC which will definitely be approximate (even with exact
> > input).
> >
> > Now the fact that Sage does not (apparently) recognise complex vectors
> > and use an appropriate definition for inner_product() is surely a bug.
> >  It should be easy to fix if the parent field is CC (or is coerciable
> > to CC?).
> >
> > John
> >
> > On 06/01/2008, Fabio Tonti <[EMAIL PROTECTED]> wrote:
> >
> >
> >
> > > sage: u=vector([2+3*I,5+2*I,-3+I])
> > > sage: v=vector([1+2*I,-4+5*I,0+5*I])
> > > sage: p1=u*v;p1.expand()
> > > 9*I - 39
> > > sage: p2=u.inner_product(v);p2.expand()
> >
> > > 9*I - 39
> > > sage: p3=u.dot_product(v);p3.expand()
> > > 9*I - 39
> > > sage: p4=u.inner_product(vector([i.conjugate() for i in
> v]));p4.expand()
> > > 3 - 19*I
> >
> > > Am I right in the assumption that for the inner product of two complex
> > > vectors, the result should be the sum of the element wise
>  multiplication of
> > > the  element of the first vector times the complex conjugate of the
> element
> > > of the second vector? I had to do this by hand, as you can see for p4.
> I had
> > > a look at Mathematica, and it seems like they don't do it either. So I
> might
> > > be wrong.
> >
> > > Another thing:
> > > sage: parent(p1)
> > > Symbolic Ring
> > > sage: parent(u)
> > > Vector space of dimension 3 over Symbolic Ring
> > > is it meant to be over symbolic Ring?
> >
> > > and one more:
> > > sage: k=vector([complex(1,2),complex(3,4),complex(25,15)])
> > > Traceback (most recent call last):
> > > ...
> > > TypeError: unable to find a common ring for all elements
> >
> > > seriously? why that?
> > > sage:
> > > u=vector(CC,[complex(1,2),complex(3,4),complex(25,15)]);u
> > > (1.00 + 2.00*I, 3.00 +
> > > 4.00*I
> > > , 25.0 + 15.0*I)
> > > And now I've got creepy precision stuff in there. And the inner
> product
> > > still doesn't do what I'd like it to.
> >
> > > Does a complex number from CC constructed by complex(,) have
> as
> > > resulting real and imaginary part have elements from RR? What's the
> > > difference between RR and QQ anyway? QQ is arbitrary precision, does
> RR use
> > > machine precision maybe?
> >
> > > Now maybe I've asked too many questions, but I've had no luck with the
> > > reference manual so far (maybe I just don't get the explanations in
> > > there...).
> > > I know that today there's the big AMS meeting (good luck for that), so
> no
> > > need to hurry in order to reply for anyone. And excuse my English,
> there
> > > maybe some mistakes since I'm in a rush...
> >
> > > Thanks a lot, Fabio
> >
> > --
> > John Cremona
> >
>

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: SCREMS Proposal

2008-01-10 Thread mabshoff



On Jan 10, 10:37 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> Hi,
>
> In 12 hours I will submit the SCREMS proposal I mentioned a few days ago, 
> which
> would get us two very nice 128GB 16 x 3Ghz servers.
>
> I've substantially updated the proposal, including a new major section by the 
> E8
> ATLAS group, actually filling in the budget and summary, etc.  It's here:
>
>http://sage.math.washington.edu/grants/screms
>
> Please let me know about any typos you find, any problems you see with
> the wording, or anything else.   (Note  -- I am aware that several references
> to papers are not done right now.)

On the first page of the project description you write: "This computer
is the home for Sage (see Section 3), which is by far the most
ambitious open source mathematical software development project ever."

While I think Sage is ambitious I wouldn't call it "by far the most
ambitious open source mathematical software development project ever"
- and dial that sentence down a little like "a very ambitious open
source mathematical software development project". The original
sentence sounds a little like the hyperbole Mathematica spreads around
that makes me laugh. I mean you cannot criticize and laugh about
sentences like "Mathematica is the world's most powerful global
computation system." [which is complete nonsense and utterly false]
and then write the above description of Sage. I might just be overly
tired and cranky, so I am catching some sleep now.

> Thanks!

Cheers,

Michael

> -- William, B. Binegar, M. Rubinstein, C. Doran, R. Miller
>
> --
> William Stein
> Associate Professor of Mathematics
> University of Washingtonhttp://wstein.org
--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: rational points in projective space

2008-01-10 Thread William Stein

On Jan 10, 2008 12:21 AM, benjamin antieau <[EMAIL PROTECTED]> wrote:
>
> Below is a transcript from a SAGE session. I was playing around
> checking to make sure that a modification of the rational_points code
> gave the right answers when I noticed that there were repeats in the
> lists returned by rational_points(). Below I iterate through the list
> of rational points and count how many times each appears. For P^3
> there is a point that is returned eight times.
>
> Is this the behavior people want? I would rather assume that the
> output has no repetition, so as to aid point-counting.

This is definitely not the behavior that we want.  This is a bug,
which I've now reported to trac:

   http://trac.sagemath.org/sage_trac/ticket/1745



>
> I would be happy to fix this.
>
> Ben
>
> =
>
> sage: X=ProjectiveSpace(QQ,1)
> sage: x=X.rational_points(bound=1)
> sage: for i in x:
> ...   (i,x.count(i))
> ((0 : 1), 2)
> ((-1 : 1), 1)
> ((0 : 1), 2)
> ((1 : 1), 1)
> ((1 : 0), 1)
>
> sage: X=ProjectiveSpace(QQ,1)
> sage: x=X.rational_points(bound=3)
> sage: for i in x:
> ...   (i,x.count(i))
> ((0 : 1), 2)
> ((-3 : 1), 1)
> ((-3/2 : 1), 1)
> ((-2 : 1), 1)
> ((-2/3 : 1), 1)
> ((-1 : 1), 1)
> ((-1/2 : 1), 1)
> ((-1/3 : 1), 1)
> ((0 : 1), 2)
> ((1 : 1), 1)
> ((1/2 : 1), 1)
> ((1/3 : 1), 1)
> ((2 : 1), 1)
> ((2/3 : 1), 1)
> ((3 : 1), 1)
> ((3/2 : 1), 1)
> ((1 : 0), 1)
>
> sage: Y=ProjectiveSpace(QQ,2)
> sage: y=Y.rational_points(1)
> sage: for i in y:
> ...   (i,y.count(i))
> ((0 : 0 : 1), 4)
> ((-1 : 0 : 1), 1)
> ((0 : 0 : 1), 4)
> ((1 : 0 : 1), 2)
> ((0 : -1 : 1), 2)
> ((0 : -1 : 1), 2)
> ((1 : -1 : 1), 1)
> ((0 : 0 : 1), 4)
> ((0 : 0 : 1), 4)
> ((1 : 0 : 1), 2)
> ((0 : 1 : 1), 2)
> ((0 : 1 : 1), 2)
> ((1 : 1 : 1), 1)
> ((0 : 1 : 0), 2)
> ((-1 : 1 : 0), 1)
> ((0 : 1 : 0), 2)
> ((1 : 1 : 0), 1)
> ((1 : 0 : 0), 1)
>
> sage: Z=ProjectiveSpace(QQ,3)
> sage: z=Z.rational_points(1)
> sage: for i in z:
> ...   (i,z.count(i))
> ((0 : 0 : 0 : 1), 8)
> ((-1 : 0 : 0 : 1), 1)
> ((0 : 0 : 0 : 1), 8)
> ((1 : 0 : 0 : 1), 4)
> ((0 : -1 : 0 : 1), 2)
> ((0 : -1 : 0 : 1), 2)
> ((1 : -1 : 0 : 1), 1)
> ((0 : 0 : 0 : 1), 8)
> ((0 : 0 : 0 : 1), 8)
> ((1 : 0 : 0 : 1), 4)
> ((0 : 1 : 0 : 1), 4)
> ((0 : 1 : 0 : 1), 4)
> ((1 : 1 : 0 : 1), 2)
> ((0 : 0 : -1 : 1), 4)
> ((0 : 0 : -1 : 1), 4)
> ((1 : 0 : -1 : 1), 2)
> ((0 : 0 : -1 : 1), 4)
> ((0 : 0 : -1 : 1), 4)
> ((1 : 0 : -1 : 1), 2)
> ((0 : 1 : -1 : 1), 2)
> ((0 : 1 : -1 : 1), 2)
> ((1 : 1 : -1 : 1), 1)
> ((0 : 0 : 0 : 1), 8)
> ((0 : 0 : 0 : 1), 8)
> ((1 : 0 : 0 : 1), 4)
> ((0 : 0 : 0 : 1), 8)
> ((0 : 0 : 0 : 1), 8)
> ((1 : 0 : 0 : 1), 4)
> ((0 : 1 : 0 : 1), 4)
> ((0 : 1 : 0 : 1), 4)
> ((1 : 1 : 0 : 1), 2)
> ((0 : 0 : 1 : 1), 4)
> ((0 : 0 : 1 : 1), 4)
> ((1 : 0 : 1 : 1), 2)
> ((0 : 0 : 1 : 1), 4)
> ((0 : 0 : 1 : 1), 4)
> ((1 : 0 : 1 : 1), 2)
> ((0 : 1 : 1 : 1), 2)
> ((0 : 1 : 1 : 1), 2)
> ((1 : 1 : 1 : 1), 1)
> ((0 : 0 : 1 : 0), 4)
> ((-1 : 0 : 1 : 0), 1)
> ((0 : 0 : 1 : 0), 4)
> ((1 : 0 : 1 : 0), 2)
> ((0 : -1 : 1 : 0), 2)
> ((0 : -1 : 1 : 0), 2)
> ((1 : -1 : 1 : 0), 1)
> ((0 : 0 : 1 : 0), 4)
> ((0 : 0 : 1 : 0), 4)
> ((1 : 0 : 1 : 0), 2)
> ((0 : 1 : 1 : 0), 2)
> ((0 : 1 : 1 : 0), 2)
> ((1 : 1 : 1 : 0), 1)
> ((0 : 1 : 0 : 0), 2)
> ((-1 : 1 : 0 : 0), 1)
> ((0 : 1 : 0 : 0), 2)
> ((1 : 1 : 0 : 0), 1)
> ((1 : 0 : 0 : 0), 1)
>
> >
>



-- 
William Stein
Associate Professor of Mathematics
University of Washington
http://wstein.org

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] SCREMS Proposal

2008-01-10 Thread William Stein

Hi,

In 12 hours I will submit the SCREMS proposal I mentioned a few days ago, which
would get us two very nice 128GB 16 x 3Ghz servers.

I've substantially updated the proposal, including a new major section by the E8
ATLAS group, actually filling in the budget and summary, etc.  It's here:

http://sage.math.washington.edu/grants/screms

Please let me know about any typos you find, any problems you see with
the wording, or anything else.   (Note  -- I am aware that several references
to papers are not done right now.)

Thanks!

-- William, B. Binegar, M. Rubinstein, C. Doran, R. Miller

-- 
William Stein
Associate Professor of Mathematics
University of Washington
http://wstein.org

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Fwd: SAGE in Iran

2008-01-10 Thread William Stein

Hi Sage-Devel,

Some of you might find this interesting -- it's an email I just got from
a professor in Iran who is very excited about Sage and plans to
run a workshop there on Sage soon.   Write to him if you have any
thoughts.

 -- William

-- Forwarded message --
From: Amir Mohammad Naderi <[EMAIL PROTECTED]>
Date: Jan 10, 2008 12:31 AM
Subject: SAGE
To: [EMAIL PROTECTED]


Dear Dr. William Stein,
Hi

I'm one of the Number theory instructor in Isfahan Mathematics House
IMH(http://mathhouse.org).
i found SAGE and i work on it to my research and i like to use to my
teaching number theory and other courses .
it is a very simple and efficients for work .

in 12-15 August 2008 we have a 10th Iranian Mathematics Education
Conference in Iran(http://www.imec10yazd.com/).
i have a plan that i introduce SAGE to this conference and have a
workshop on it.

i like run workshop with your guidance,if not problem please help me.


thanks
with best regards
Naderi


-- 
William Stein
Associate Professor of Mathematics
University of Washington
http://wstein.org

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] Re: QEPCAD spkg

2008-01-10 Thread mabshoff



On Jan 10, 8:50 am, Jason Grout <[EMAIL PROTECTED]> wrote:

Hi Jason,

> Thanks to Robert Bradshaw's tremendous help, we have the start of a
> QEPCAD spkg for linux posted athttp://trac.sagemath.org/sage_trac/ticket/772
>
> The spkg does not include source because we haven't sorted out licensing
> issues.  However, it does use wget to get the source from the webpage,
> so you shouldn't have to do anything.
>
> Currently the spkg compiles on my ubuntu 32-bit linux laptop (but has
> linking issues; see the readline issue below).  Apparently there are
> some nontrivial issues with compiling SACLIB on OSX (dealing with the
> FPU or something).  It'd be great if someone who knew more about OSX
> could take a look.
>
> The spkg currently dies when trying to link to readline.  Does anyone
> know how to get a package to link to readline?

I assume you don't have readline installed. I think Ubuntu or Debian
do not install it per default. As I commented on the ticket try
linking termcap instead. Sage compiles its own termcap, so you can
assume it is in $SAGE_LOCAL/lib

> The error is:
>
> g++ -O4 -I/home/grout/sage/spkg/build/qepcad/saclib2.1/include

"-O4" is pretty pointless, "-O2" ought to be enough ;)

> -I/home/grout/sage/spkg/build/qepcad/qesource/source  -I. -o cad2d
> ../source/saclib/GCSI.c \
>  cad2d.a
> /home/grout/sage/spkg/build/qepcad/qesource/source/qepcad.a
> /home/grout/sage/spkg/build/qepcad/qesource/extensions/sfext/sfexto.a
> /home/grout/sage/spkg/build/qepcad/qesource/extensions/lift2D/lift2Do.a
> /home/grout/sage/spkg/build/qepcad/qesource/extensions/newadj/newadjo.a
> /home/grout/sage/spkg/build/qepcad/qesource/extensions/adj2d/adj2do.a
> /home/grout/sage/spkg/build/qepcad/qesource/extensions/rend/rendo.a
> /home/grout/sage/spkg/build/qepcad/qesource/extensions/sfext/sfexto.a
> /home/grout/sage/spkg/build/qepcad/qesource/source/qepcad.a
> /home/grout/sage/spkg/build/qepcad/saclib2.1/lib/saclibo.a -lreadline
> cad2d.a /home/grout/sage/spkg/build/qepcad/qesource/source/qepcad.a
> /home/grout/sage/spkg/build/qepcad/qesource/extensions/sfext/sfexto.a
> /home/grout/sage/spkg/build/qepcad/qesource/extensions/lift2D/lift2Do.a
> /home/grout/sage/spkg/build/qepcad/qesource/extensions/newadj/newadjo.a
> /home/grout/sage/spkg/build/qepcad/qesource/extensions/adj2d/adj2do.a
> /home/grout/sage/spkg/build/qepcad/qesource/extensions/rend/rendo.a
> /home/grout/sage/spkg/build/qepcad/qesource/extensions/sfext/sfexto.a
> /home/grout/sage/spkg/build/qepcad/qesource/source/qepcad.a
> /home/grout/sage/spkg/build/qepcad/saclib2.1/lib/saclibo.a -lreadline
> /home/grout/sage/local/lib/../lib/libreadline.so: undefined reference to
> `PC'
> /home/grout/sage/local/lib/../lib/libreadline.so: undefined reference to
> `tgetflag'
> /home/grout/sage/local/lib/../lib/libreadline.so: undefined reference to
> `tgetent'
> /home/grout/sage/local/lib/../lib/libreadline.so: undefined reference to
> `UP'
> /home/grout/sage/local/lib/../lib/libreadline.so: undefined reference to
> `tputs'
> /home/grout/sage/local/lib/../lib/libreadline.so: undefined reference to
> `tgoto'
> /home/grout/sage/local/lib/../lib/libreadline.so: undefined reference to
> `tgetnum'
> /home/grout/sage/local/lib/../lib/libreadline.so: undefined reference to
> `BC'
> /home/grout/sage/local/lib/../lib/libreadline.so: undefined reference to
> `tgetstr'
> collect2: ld returned 1 exit status
> make: *** [opt] Error 1
>
> Thanks,
>
> Jason
>
> P.S. Thank you SO MUCH to everyone who worked on getting email to work
> on trac.  It's so nice to get notifications of changes to tickets!

You are welcome. I think the work flow improved greatly ;)

Cheers,

Micahel
--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---



[sage-devel] rational points in projective space

2008-01-10 Thread benjamin antieau

Below is a transcript from a SAGE session. I was playing around
checking to make sure that a modification of the rational_points code
gave the right answers when I noticed that there were repeats in the
lists returned by rational_points(). Below I iterate through the list
of rational points and count how many times each appears. For P^3
there is a point that is returned eight times.

Is this the behavior people want? I would rather assume that the
output has no repetition, so as to aid point-counting.

I would be happy to fix this.

Ben

=

sage: X=ProjectiveSpace(QQ,1)
sage: x=X.rational_points(bound=1)
sage: for i in x:
...   (i,x.count(i))
((0 : 1), 2)
((-1 : 1), 1)
((0 : 1), 2)
((1 : 1), 1)
((1 : 0), 1)

sage: X=ProjectiveSpace(QQ,1)
sage: x=X.rational_points(bound=3)
sage: for i in x:
...   (i,x.count(i))
((0 : 1), 2)
((-3 : 1), 1)
((-3/2 : 1), 1)
((-2 : 1), 1)
((-2/3 : 1), 1)
((-1 : 1), 1)
((-1/2 : 1), 1)
((-1/3 : 1), 1)
((0 : 1), 2)
((1 : 1), 1)
((1/2 : 1), 1)
((1/3 : 1), 1)
((2 : 1), 1)
((2/3 : 1), 1)
((3 : 1), 1)
((3/2 : 1), 1)
((1 : 0), 1)

sage: Y=ProjectiveSpace(QQ,2)
sage: y=Y.rational_points(1)
sage: for i in y:
...   (i,y.count(i))
((0 : 0 : 1), 4)
((-1 : 0 : 1), 1)
((0 : 0 : 1), 4)
((1 : 0 : 1), 2)
((0 : -1 : 1), 2)
((0 : -1 : 1), 2)
((1 : -1 : 1), 1)
((0 : 0 : 1), 4)
((0 : 0 : 1), 4)
((1 : 0 : 1), 2)
((0 : 1 : 1), 2)
((0 : 1 : 1), 2)
((1 : 1 : 1), 1)
((0 : 1 : 0), 2)
((-1 : 1 : 0), 1)
((0 : 1 : 0), 2)
((1 : 1 : 0), 1)
((1 : 0 : 0), 1)

sage: Z=ProjectiveSpace(QQ,3)
sage: z=Z.rational_points(1)
sage: for i in z:
...   (i,z.count(i))
((0 : 0 : 0 : 1), 8)
((-1 : 0 : 0 : 1), 1)
((0 : 0 : 0 : 1), 8)
((1 : 0 : 0 : 1), 4)
((0 : -1 : 0 : 1), 2)
((0 : -1 : 0 : 1), 2)
((1 : -1 : 0 : 1), 1)
((0 : 0 : 0 : 1), 8)
((0 : 0 : 0 : 1), 8)
((1 : 0 : 0 : 1), 4)
((0 : 1 : 0 : 1), 4)
((0 : 1 : 0 : 1), 4)
((1 : 1 : 0 : 1), 2)
((0 : 0 : -1 : 1), 4)
((0 : 0 : -1 : 1), 4)
((1 : 0 : -1 : 1), 2)
((0 : 0 : -1 : 1), 4)
((0 : 0 : -1 : 1), 4)
((1 : 0 : -1 : 1), 2)
((0 : 1 : -1 : 1), 2)
((0 : 1 : -1 : 1), 2)
((1 : 1 : -1 : 1), 1)
((0 : 0 : 0 : 1), 8)
((0 : 0 : 0 : 1), 8)
((1 : 0 : 0 : 1), 4)
((0 : 0 : 0 : 1), 8)
((0 : 0 : 0 : 1), 8)
((1 : 0 : 0 : 1), 4)
((0 : 1 : 0 : 1), 4)
((0 : 1 : 0 : 1), 4)
((1 : 1 : 0 : 1), 2)
((0 : 0 : 1 : 1), 4)
((0 : 0 : 1 : 1), 4)
((1 : 0 : 1 : 1), 2)
((0 : 0 : 1 : 1), 4)
((0 : 0 : 1 : 1), 4)
((1 : 0 : 1 : 1), 2)
((0 : 1 : 1 : 1), 2)
((0 : 1 : 1 : 1), 2)
((1 : 1 : 1 : 1), 1)
((0 : 0 : 1 : 0), 4)
((-1 : 0 : 1 : 0), 1)
((0 : 0 : 1 : 0), 4)
((1 : 0 : 1 : 0), 2)
((0 : -1 : 1 : 0), 2)
((0 : -1 : 1 : 0), 2)
((1 : -1 : 1 : 0), 1)
((0 : 0 : 1 : 0), 4)
((0 : 0 : 1 : 0), 4)
((1 : 0 : 1 : 0), 2)
((0 : 1 : 1 : 0), 2)
((0 : 1 : 1 : 0), 2)
((1 : 1 : 1 : 0), 1)
((0 : 1 : 0 : 0), 2)
((-1 : 1 : 0 : 0), 1)
((0 : 1 : 0 : 0), 2)
((1 : 1 : 0 : 0), 1)
((1 : 0 : 0 : 0), 1)

--~--~-~--~~~---~--~~
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/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---