Thanks, I had definitely missed that this was now in the reference
manual.
Ben
On Jun 17, 12:50 pm, John H Palmieri wrote:
> Right now, the coercion section of Developer's guide starts off by
> saying
>
> **September 2008:** Much of this material is out of date. We are
> working on a revis
Oh, and this is also the case over other base rings, like over GF(p).
On May 18, 2:43 pm, benjamin antieau wrote:
> I noticed the following incorrect behavior.
>
> sage: C=simplicial_complexes.ChessboardComplex(3,3).chain_complex()
> sage: C.category()
> Category of chain complex
I noticed the following incorrect behavior.
sage: C=simplicial_complexes.ChessboardComplex(3,3).chain_complex()
sage: C.category()
Category of chain complexes over Integer Ring
sage: A=C.category()
sage: A.is_abelian()
False
As far as I can tell ChainComplexes inherits is_abelian from
AbelianCat
is in Sage should be put onto our
> useful-projects-for-students list.
>
> John
>
> On 16/01/2008, D. Benjamin Antieau <[EMAIL PROTECTED]> wrote:
> > Enrique,
> >
> > This can easily be done at the moment, assuming that you want to count
> > integral points up
Enrique,
This can easily be done at the moment, assuming that you want to count
integral points up to a certain height N. If you are looking for all of the
points of something you know has only finitely many, I am not so sure.
I hope the following ramble helps.
sage: A,B,C,D,E,F=[1,0,0,0,0,-1] #
On Jan 14, 2008 8:07 AM, William Stein <[EMAIL PROTECTED]> wrote:
>
> On 1/14/08, John Cremona <[EMAIL PROTECTED]> wrote:
> >
> > I think that as more people use Sage -- especially to do highly
> > nontrivial computations like this, which are likely unavailable in
> > other systems -- we will get
To all,
I've created a sage file to calculate, among other things, the Hodge numbers
of an arbitrary complete intersection. Attached is the .sage file. I also
attempted to create a .spkg file, but it does not seem to work. Mine
contains simply a .py file that the install script puts it
$SAGE_ROOT/
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 co
A minor correction.
On page 2, line -4 the word read is repeated.
On May 28, 8:39 pm, David Joyner <[EMAIL PROTECTED]> wrote:
> Hello Emil, SAGE developers:
>
> Following a suggestion of Emil Volcheck of ACM/SIGSAM and Bob Grafton
> of NSF, and William and I have drafted a "white paper" on NFS f
All tests passed on ubuntu 6.0.6. with sage-2.4-rc3.
On Mar 24, 11:06 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> I've posted a release candidate for sage-2.4 here:
>
> http://sage.math.washington.edu/home/was/tmp/rc/
>
> It would be helpful if a few people would build this and, if that work
10 matches
Mail list logo
