On Mar 18, 11:56 pm, "Nicolas M. Thiery"
wrote:
> > On the subject of pickling I just found out the hard way that the pickle jar
> > is no longer tested by default, since trac_10712, which was merged in 4.6.2
> > marks the following test in sage_object.pyx long time that tests the
> > pickle jar.
Dear posets friends,
I am in the process of creating categories for posets/lattices/... in
preparation for later having several classes for posets, including
infinite/lazy/... (see e.g. #10783, #10777). The patch will also
include quite some code from Christian, Frédéric, Franco. The plan
Hi!
A couple of updates about Sage Days 30 at Acadia University in
Wolfville, Nova Scotia:
Most crucially, the dates have changed: it is now taking place May
2-6.
We do have a web site, in the expected place: http://wiki.sagemath.org/days30
We also have some more speakers lined up: Jason Bandl
My guess is that nobody stepped up to submitting the required materials, and
the GSOC results have already been announced.
David
On Sat, Mar 19, 2011 at 02:31, David Kirkby wrote:
> On 18 March 2011 19:06, Harald Schilly wrote:
> > Sage won't be a host organization in the GSoC program. Submitti
Dear Jason,
>> Jason-- You originally requested this. Why?
>
> It looks like our discussion about why is up at
> http://trac.sagemath.org/sage_trac/ticket/729
There is no discussion there-- you simply say it should be that way.
You cite an article, claiming that it states that rich comparison
ope
On Thu, Mar 17, 2011 at 03:29:08PM +0100, Jeroen Demeyer wrote:
> On 2011-03-17 15:04, Jason Grout wrote:
> > def hash(self):
> > h=0
> > for i,j,entry in m.nonzero_entries(): # nonzero entries for sparse
> > matrices
> >h^=hash(entry)^i^j
> > return h
>
> Since you're only xor
Hi Rob,
On Sat, Mar 19, 2011 at 12:19:45AM -0700, Rob Beezer wrote:
> On Mar 18, 11:56 pm, "Nicolas M. Thiery"
> wrote:
> > > On the subject of pickling I just found out the hard way that the pickle
> > > jar
> > > is no longer tested by default, since trac_10712, which was merged in
>
On Sat, Mar 19, 2011 at 8:10 AM, Nicolas M. Thiery
wrote:
> On Thu, Mar 17, 2011 at 03:29:08PM +0100, Jeroen Demeyer wrote:
>> On 2011-03-17 15:04, Jason Grout wrote:
>> > def hash(self):
>> > h=0
>> > for i,j,entry in m.nonzero_entries(): # nonzero entries for sparse
>> > matrices
>> >
On Saturday, March 19, 2011 7:31:21 AM UTC+1, Dr. David Kirkby wrote:
>
> Why has a decision been made not to make a GSoC application?
There was no such decision and I was the one submitting an application this
year. Unfortunately, rejected once again. :\
H
--
To post to this group, send an e
On Mar 19, 8:13 am, "Nicolas M. Thiery"
wrote:
> Oops, I should have reformulated my message differently. My point was
> not to blame anyone on that change!
No worries. Wasn't taken that way.
Just accepting responsibility. ;-)
> Will do!
Good!
--
To post to this group, send an email to sag
sagetolerance * DBL_EPSILON <= abs(f(x)-expected_result)
would be one general method to test for epsilon equivalency at double
precision.
On Mar 17, 7:06 am, Jason Grout wrote:
> On3/17/11 12:35 AM, Robert Bradshaw wrote:
>
>
>
>
>
> > On Wed, Mar 16, 2011 at 6:15 PM, Jason Grout
> > wrote:
>
On Mar 17, 3:29 pm, Jeroen Demeyer wrote:
> On 2011-03-17 15:04, Jason Grout wrote:
>
> > def hash(self):
> > h=0
> > for i,j,entry in m.nonzero_entries(): # nonzero entries for sparse
> > matrices
> > h^=hash(entry)^i^j
> > return h
>
> Since you're only xorring, this will gi
On 3/19/11 7:44 AM, Robert Miller wrote:
Dear Jason,
Jason-- You originally requested this. Why?
It looks like our discussion about why is up at
http://trac.sagemath.org/sage_trac/ticket/729
There is no discussion there-- you simply say it should be that way.
You cite an article, claiming t
Hi Nicolas,
I am not sure how relevant it is, but there is a function
sage.geometry.polyhedra.Hasse_diagram_from_incidences
which actually may be useful for more general posets than just face
lattices.
So perhaps it should be moved/integrated somewhere more suitable. (It
was already moved once be
14 matches
Mail list logo
