On Mar 25, 6:52 pm, Ben Hutz wrote:
> The resultant of two homogeneous polynomials can return an incorrect
> value:
> R.=PolynomialRing(ZZ)
> f=6*x^2 + x*y + y^2
> g=y^2
> print f.resultant(g)
> m=matrix([[6,1,1,0],[0,6,1,1],[0,0,1,0],[0,0,0,1]])
> m.determinant()
>
> notice that the coefficient o
In the mean time, I added another upstream fix to PARI: issquarefree(0)
used to raise an error instead of returning 0.
Three tickets, including the gcc spkg (hence, OS X 10.7 support) depend
on this, so I consider it an important ticket.
So, please review:
http://trac.sagemath.org/sage_trac/ticke
Hello sage-devel,
Schemes and their points are not yet properly embedded in the category
framework. One of the trac tickets listing the issues is
http://trac.sagemath.org/sage_trac/ticket/7946
which mentions that Volker Braun had resolved some of the issues but
some related to elements still r
I'll just remind people that we have a sage-gsoc list where people are
sending proposals or ideas for projects. It seems that a number of
emails there have no reply. It'd be great if you had time to reply to
one or two of the emails over there. I'll try to reply to one or two today.
https:/
John H Palmieri writes:
> The functions like "is_Integer" are deprecated. If you compare the alternative
>
>isinstance(5/1, Integer)
>
> with
>
>5/1 in ZZ
>
> I definitely want the first to return False, and I'm also happy if the second
> returns True. It makes more sense to me for the sec
On Monday, March 26, 2012 9:32:45 AM UTC-7, Keshav Kini wrote:
>
> Simon King writes:
> > sage: is_Integer(int(5))
> > False
> > sage: is_Integer(5/1)
> > False
> > sage: int(5) in ZZ
> > True
> > sage: 5/1 in ZZ
> > True
>
> Huh. It seems like this is the opposite of what you'd e
Simon King writes:
> sage: is_Integer(int(5))
> False
> sage: is_Integer(5/1)
> False
> sage: int(5) in ZZ
> True
> sage: 5/1 in ZZ
> True
Huh. It seems like this is the opposite of what you'd expect, doesn't
it? "object in object" seems to be a query of whether a certain thing is
Am 2012-03-26 00:16, schrieb Nathann Cohen:
> Hellooo !!!
>
> Sage has no Module/Class for things like Finite State Machines, Automata
> and Transducers. That should be changed. ;)
>
> Perhaps the "Word guys" would be interested in the adventure, by the way :-)
:)
For clearif
Am 2012-03-24 20:11, schrieb Jason Grout:
> On 3/24/12 3:05 PM, Daniel Krenn wrote:
>
>> Further, there are a lot of packages written in Python on that things,
>> but it seems, that each is just for a special purpose; nothing that can
>> be easily adapted to do all (and maybe more) of the things a
On 25 Mrz., 20:29, Julien Puydt wrote:
> Le dimanche 25 mars, leif a écrit:
> > I.e., they're still there (most of them, only four empty files got
> > deleted), after ptestlong has finished (btw. without errors).
>
> Were they only from "make ptestlong" or also from the compilation?
I deleted all
On 2012-03-26 07:25, Simon King wrote:
> On 2012-03-26, Ben Hutz wrote:
>> Traceback (most recent call last):
>> ...
>> RuntimeError: Segmentation fault
>
> Oh, and by the way: What you get is a RuntimeError, not a segmentation
> fault in Sage (apparently Sage only complains about a segmentation
I'd like to add the resultant problem I posted to sage-devel
yesterday. It sounds like it is an actual bug, but not filed. When my
trac account gets approved I'll file a bug for it.
On Mar 21, 2:56 pm, William Stein wrote:
> Hi Proud Sage Developers,
>
> At the current Sage workshop some people
opps, I should have read the docs on that one.
On Mar 26, 1:14 am, Simon King wrote:
> Hi Ben,
>
> On 2012-03-26, Ben Hutz wrote:
>
> > In working with polynomials
>
> > R.=PolynomialRing(ZZ)
> > F=x^2*y-2*x^2-x
> > print F.coefficients()[0].parent()
> > print F.coefficient({x:2,y:1}).parent()
>
Sounds good. Thanks.
On Mar 26, 1:34 am, Simon King wrote:
> On 2012-03-26, Simon King wrote:
>
> > So, it is a bug, and I am about to open a trac ticket for it.
>
> It ishttp://trac.sagemath.org/sage_trac/ticket/12748
>
> Cheers,
> Simon
--
To post to this group, send an email to sage-devel@g
On Monday 26 Mar 2012, Simon King wrote:
> Hi Ben,
>
> On 2012-03-26, Ben Hutz wrote:
> > In working with polynomials
> >
> > R.=PolynomialRing(ZZ)
> > F=x^2*y-2*x^2-x
> > print F.coefficients()[0].parent()
> > print F.coefficient({x:2,y:1}).parent()
> >
> > The first returns the base ring (Z
Hi!
On 2012-03-26, Mike Hansen wrote:
> On Sun, Mar 25, 2012 at 11:06 PM, Starx wrote:
> See sage/all.py -- they are only deprecated from Sage's "global
> namespace" in order to avoid users seeing things like
>
> sage: is_Integer(int(2))
> False
Since I talked about timings in my previous post
PS:
On 2012-03-26, Simon King wrote:
> Also note that by some recent patch, the recommended way of testing properties
> is not only better from a mathematical point of view, but it is also
> **faster** (at least if we are talking about a category without a base
> ring):
>
> (with sage-5.0.beta8)
Hi!
On 2012-03-26, Mike Hansen wrote:
> On Sun, Mar 25, 2012 at 11:06 PM, Starx wrote:
>> 1) How are functions depreciated?
>
> See sage/all.py
Namely
message = "\nUsing %(name)s from the top level is deprecated since it was
designed to be used by developers rather than end users.\nIt most li
Your diagnosis makes sense, since in PARI there are no multivariate
polynomials, only polys with poly coefficients.
John
On 26 March 2012 02:52, Ben Hutz wrote:
> The resultant of two homogeneous polynomials can return an incorrect
> value:
> R.=PolynomialRing(ZZ)
> f=6*x^2 + x*y + y^2
> g=y^2
19 matches
Mail list logo
