Hi Adrien,
I would also really like to know if this is settled. When I answered the
doodle, it seemed like the most probable date was the 10th of March. But
now I see many more people have answered and it could be the 7th of April
(where I'm not available).
So when is it at the end? (I need to kn
So, no Sage Days in the US this summer ? What happened to the
Berkeley-Davis Sage days ?
See you
Viviane
2014-03-11 21:46 GMT+01:00 Anne Schilling :
> Hi!
>
> Just heads up:
>
> Aaron Lauve and Peter Tingley are planning to host Sage Days in Chicago
> during the
> summer of 2015 (not 2014!!).
Hi guys,
the main part of the PyCon conference just finished yesterday (now, it's
sprint time!). I'm going to write you soon a full report on how great and
useful it was, and also some links to the pycon videos.
But just a quick word right now about some upcomig conferences you should
be aware of
Hi guys,
so I'm still at PyCon 2014 Montreal for the sprint time. But I find it is
the right time to give you some kind of report of my time here. Quick
hints: it was one of the most useful, greatest conference I have ever been,
and also, it was HUGE. There were around 2000 people (of which I knew
Is anyone submitting to this? I'm not and I won't go, but I'm curious!
-- Message transféré --
From: Chee Yap
To: sigsam-frie...@listserv.acm.org
Cc:
Date: Mon, 28 Apr 2014 22:49:01 -0400
Subject: [SIGSAM] Final Call for Abstracts: ICMS August 2014
Dear Colleagues,
The 4th I
I think the Foo class must also inherit from the Element class.
Viviane
2014-05-16 15:50 GMT+02:00 Bruce :
> I am trying to construct formal linear combinations of instances of a
> particular class.
> I have asked about this before and, I think, was given the following
> template
>
>
> class Fo
I would say: include whatever you feel useful in the documentation. As a
new user of the object, you're the best to know which explanations we need.
2014-05-17 20:29 GMT+01:00 Bruce :
> Thanks, Travis.
>
> I changed this to
>
> class Foo(Element):
> def __init__(self, a):
> self.data
Just so you know, I intend to "fix" the decorator at some point to reduce
whatever impact it could have (I learned a bit a more about decorator while
at PyCon). We could also think of adding more semantic information to make
the usecase for sage more obvious (I really do think there is one).
Also,
Sorry Nathann, I don't take orders.
If you want to open tickets, just do so. I don't think a ticket removing
the map decorator all together would be positively reviewed right now. If
you really want to know my time frame, I *intend* to work on this decorator
to make it better this summer. If someo
>
>
> thanks for the fast reply -- but I need statistics, not maps. I..e, I'd
> like to have a list of all methods applying to permutations that return a
> number...
>
I don't think there is anything like that for statistics, maybe the sign
that we do need more semantic into Sage?
>
> Is it corr
>
> I guess this is getting slightly off topic now, so I'll continue in
> private, unless someone objects...
>
For anything related to FindStat, you can write to i...@findstat.org :)
>
> Many thanks,
>
> Martin
>
> --
> You received this message because you are subscribed to the Google Groups
> That being said we do not want to register all computable maps on
> startup. So we have to find the good balance between interesting maps
> as "the number of descents in a permutation" and uninteresting maps as
> "the polynomial map 57*n^2 - 18*n +3 from {-12, 1, 42, 2243} to the
> integers".
>
>
>
> Dead right ! Is there any reason why gathering this semantic information
> requires this decorator to wrap the function in a combinatorial map ? Can't
> the information be gathered wherever we need it *without* modifying the
> actual function ? You could do whatever you need with a decorator th
> chat: pauloliv...@gmail.com
> twitter: podehaye
> freenode irc: pdehaye
>
>
> On Wed, May 28, 2014 at 12:13 AM, Simon King wrote:
>
>> Hi Viviane,
>>
>> On 2014-05-27, Viviane Pons wrote:
>> > The way it works: the decorator replaces the tagged methods
I find it quite difficult now to follow this thread, I see the answer to
some emails that are not even in the thread...
Anyway, I just want to answer to this specific sentence of Nathan: "This is
only technical issues, nothing more. But I hate that it takes one year to
see it fixed."
Well, Nathan
I think we all agree on this idea now (that the decorator should not wrap
the method), so there is no point in keeping the argument.
Still, I have asked a few questions on which I'd like you guys opinions:
- what's the best way to store this information? Nathan and Simon mentioned
database, would
I actually do think it would be a really good thing to have a statfinder
within sage, and somehow merge findstat code with sage code. It would
benefit both sage and findstat users. At the end, both FindStat and Sage
have the same aim: using computers to help us doing research. I understand
complete
Hi everyone,
I gave a 5 minutes lighting talk yesterday at SciPy on "Experimental pure
mathematics with sage" and it was quite a success!
You can watch it here:
https://www.youtube.com/watch?v=SMyto7WHiNs&list=PLYx7XA2nY5GfuhCvStxgbynFNrxr3VFog
(at 30:20)
I intend to make it a long talk for ne
Hi everyone,
I've just written to the PyCon organizing team about making SageDays as a
satelite even for next year conference (April 2015). The idea would be to
organize the Sage Days during the sprint days of the PyCon conference. This
is not done yet but I'm very confident it's going to happen!
Hi everyone,
a reminder that you still have until 15th of September to submit a talk for
PyCon 2015 in Montreal. I read some of you are attending SciPyEurope or
EuroPython and that's great!
A talk proposal is much shorter than a conference paper, mine took only one
day to write. If you don't know
Dear all,
As I have mentioned before, there will be some Sage Days during the next
PyCon in Montreal:
PyCon: April 8-16, 2015
Sage-Days 67: April 13-16, 2015 (during PyCon sprints)
You can find all needed informations here: http://wiki.sagemath.org/days67
Important deadline: financial aid appli
Hi,
I don't know about your import error. But I just wanted to say than
unordered trees were implemented a while ago but never finished...
Here's the ticket:
http://trac.sagemath.org/ticket/11529
I'm not saying you should use those, maybe it's better to start from
scratch, but it's always good
ut being merged, Nicolas
and Florent are the ones who should know the status...
> P.S. Viviane Pons, what is "ot"?
>
typo: I meant "it"
Best,
Viviane
> --
> You received this message because you are subscribed to the Google Groups
> "sage-combinat-
Hi everyone,
here is a second call to invite you to participate to Sage Days and PyCon
this spring in Montreal:
PyCon: April 8 -12
Sage Days: April 13 - 16 (during PyCon sprints)
All informations here: http://wiki.sagemath.org/days67
Especially, if you intend to come to PyCon: register quicly!
2015-03-18 12:40 GMT+01:00 Mike Zabrocki :
> That would make sense. My preference is that (at least for values less
> than 15) the default is that the output is sorted and this can be
> controlled by the optional parameter.
>
> I think about how many times that I test symmetric function identitie
Hi Nathann,
Isn't it possible to just remove the link to the mupad page from the menu
without removing the page? Then the page would only be accessible from the
combinat page, which makes sense. Honestly, I cannot see the cost of
hosting a html page on a related former project...
Best
Viviane
2
Dear all,
I'm happy to announce SageDays78 to happen in Vancouver, June 29 to July
1st 2016:
https://wiki.sagemath.org/days78
These SageDays are organized as a satellite event of the combinatorics
conference FPSAC. The main topic will then be combinatorics. Please follow
the link for more inform
Viviane
2016-03-03 10:38 GMT+01:00 Viviane Pons :
> Dear all,
>
> I'm happy to announce SageDays78 to happen in Vancouver, June 29 to July
> 1st 2016:
>
> https://wiki.sagemath.org/days78
>
> These SageDays are organized as a satellite event of the combinatorics
>
Little correction; it is Mike Zabrocki (and not Zabroky as I spelled it,
sorry Mike!)
2016-04-07 14:25 GMT+02:00 Viviane Pons :
> Dear all,
>
> here is a reminder about the SageDays78 in Vancouver, June 29 to July 1st
> 2016:
>
> https://wiki.sagemath.org/days78
>
&
Dear all,
the program for Sage Days 78 in Vancouver is now on line:
https://wiki.sagemath.org/days78
If you intend to join us please register if you haven't done so already!
Best
Viviane
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group
Dear all,
the first ever workshop for women in Sage in Europe (the previous ones were
in the US) will be organized January 9 - 13, 2017 by Jessica Striker,
Jennifer Balakrishnan, and myself.
We will rent a house in Paris area and organize coding sprints, tutorials,
and presentations.
All Sage le
Dear colleagues and fellow developers,
This is reminder for the conference "Calcul Mathématique Libre" which we
organize in CIRM (Marseilles) on Feb 11-15, 2019. Please register **before
January 7**.
This community building and training conference aims to bring together
users and developers of (o
Dear fellow developers,
I am organizing a "Women in Sage" event with Eleni Tzanaki: April 9 -- 12
in Archanes, Crete.
https://wiki.sagemath.org/days98
All local expenses are covered and we can provide travel funding.
The number of participants is limited: applications are due by Feb. 28. All
Sa
Dear Sage people,
we have an opportunity to organize some Sage Days in Nigeria (university of
Ibadan). These would be targeted mostly at local people of the university
of Ibadan and other Nigerian universities. We have a local contact who is
in charge of all the practical aspects.
We are looking
Hi everyone,
I'm a very new sage developer and I just started working with Adrien
on multivariate polynomials.
As it is now, our objetcs are indexed by IntergerVectors but we can't
keep it this way as we need negative values. We're thinking of using
Sequences (sage.categories.category_types.Seque
Hi everyone,
I'am working with modules and making lots of morphism between them I
just discovered a bug with the method "has_coerce_map_from" . This is
the method you use from the codomain to check if a coercion exist to
another domain. Obviously, instead of just checking, the method is
changing t
s should be set
before any attempts to use them. Hopefully someone will correct me, if
I am wrong.
Thank you,
Andrey
On Jul 8, 8:05 am, Viviane Pons wrote:
Hi everyone,
I'am working with modules and making lots of morphism between them I
just discovered a bug with the method "has_coerce_
actually
doing something, it should be called "look_for_coercion" or something
like that. This name (and the doc) says it's a checking method not an
active method.
Regards
Viviane
2010/7/10 Nicolas M. Thiery :
> Hi Viviane,
>
> On Sat, Jul 10, 2010 at 12:04:06PM
Hi Nicolas,
I'm working on root sytem & friends on the patch I'm developing for
multivariate polynomials :
trac_6629_abstract_ring_of_multivariate_polynomials_with_several_bases_vp.patch
It's still in progress and there are no tests yet (so you won't see it
if you break it). root system are used
t I register the morphism in the init of
FinitePolynomialRingWithBasisFromAmbientSpace (the object I create)
but i'm not sure it's a good solution as you may want to create the
object without registering the morphism.
Tell me what you think
Regards
Viviane
2010/7/12 Nicolas M. Thiery :
Hi everyone,
I'm implementing multivariate polynomials over different basis right
now and I have to compute a scalar product. I don't know which object
or functions I should use, here is my definition :
(f,g) = CT( f(x_1, ... x_n) g(1/x_n, ..., 1/x_1) Prod_{i,j<=n}(1-x_i/x_j))
So the first part
I forgot the i
Hi Viviane,
I'm implementing multivariate polynomials over different basis right
now and I have to compute a scalar product. I don't know which object
or functions I should use, here is my definition :
(f,g) = CT( f(x_1, ... x_n) g(1/x_n, ..., 1/x_1)
Prod_{i,j<=n}(1-x_i/x_j))
Hi everyone,
I am still implenting multivariate poynomials on multi bases and I'm
trying to understand how the __contains__ method works. I can't access
to the code :
sage: M.__contains__??
Error getting source: arg is not a module, class, method, function,
traceback, frame, or code object
Type:
Hi everyone,
I would like to send the "facade" init parameter to a
CombinatorialFreeModule, but it's not supported whereas it is for
Parent. Should I create a ticket and fix that ?
Regards
Viviane
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-deve
yway
2010/9/27 Nicolas M. Thiery :
> Hi Viviane,
>
> On Mon, Sep 27, 2010 at 11:03:27AM +0200, Viviane Pons wrote:
>> I would like to send the "facade" init parameter to a
>> CombinatorialFreeModule, but it's not supported whereas it is
ult parent method which leads to a conctradiction in the way
__contains__ works
Thanks for your help anyway
Viviane
2010/9/27 Nicolas M. Thiery :
> Hi Viviane!
>
> On Mon, Sep 27, 2010 at 03:42:55PM +0200, Viviane Pons wrote:
>> I was seeing it the other way arround : th
Nicolas
>
> On Fri, Oct 22, 2010 at 02:38:50PM +0200, Viviane Pons wrote:
>> Bonjour,
>>
>> je ne suis pas chez moi ce week end et ne peux pas regarder ça. J'ai
>> en effet fait un push hier mais le patch s'appliquait correc
Hi everyone,
I'm still working on multivariate polynomials but I try now to see how
could work double multivariate polynomials, I.E in two sets of
variables.
What I try to do is this :
sage: A = AbstractPolynomialRing(QQ);A
The abstract ring of multivarate polynomials over Rational Field
sage: B
How do you create coercion with something that is not a combinatorial
free module ?
Le 26/10/2010 18:51, Nicolas M. Thiery a écrit :
Hi Viviane!
On Tue, Oct 26, 2010 at 05:02:07PM +0200, Viviane Pons wrote:
I'm still working on multivariate polynomials but I try now to see how
M. Thiery :
> On Tue, Oct 26, 2010 at 07:47:03PM +0200, Viviane Pons wrote:
>> How do you create coercion with something that is not a
>> combinatorial free module ?
>
> As usual: you create a morphism. In that case, you can use
> SetMorphism to create a mor
Hi everyone,
dealing with my multivariate polynomials on multi bases, I had a look
into the code of TriangularModuleMorphism especially the part that
inverse a triangular morphism defined on the basis. The method
"preimage" is working well and uses the usual algorithm to inverse
triangular morphim
argument to force the inverse on basis when
needed).
2010/12/1 Nicolas M. Thiery :
> Hi Vivianne,
>
> On Wed, Dec 01, 2010 at 03:31:51PM +0100, Viviane Pons wrote:
>> dealing with my multivariate polynomials on multi bases, I had a look
>> into the code of TriangularModu
Hi everyone,
I just opened a ticked on trac about the getitem method on an ambient
space basis of a root system
http://trac.sagemath.org/sage_trac/ticket/10995
Nicolas, I believe Florent told you about that on Friday when we
looked at it. Is there someone who can fix it or should I do it myself
I created a patch :
trac_10995-fixing_getitem_on_ambient_space-vp.patch
under the "Root System and crystals"
and added the fix, I changed my trac to "need review".
Cheers
Viviane
2011/3/23 Nicolas M. Thiery :
> Hi Viviane,
>
> On Wed, Mar 23, 2011 at 1
Ok, I did the simple >0 and <= dimension, it seems to be the quickest.
I uploaded it on trac, so here you go !
Cheers,
Viviane
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To post to this group, send email to sage-combinat-devel@goo
ok, done and I updated the patch on the ticket as well.
Cheers,
Viviane
2011/3/24 Nicolas M. Thiery :
> On Thu, Mar 24, 2011 at 02:49:45PM +0100, Viviane Pons wrote:
>> Ok, I did the simple >0 and <= dimension, it seems to be the quickest.
>>
>> I uploaded
Ok, I've followed the instructions and exported the patch. I also
moved it up into the queue so that it appears with the positive
reviewed patches.
Regards
Viviane
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To post to this group, s
Hi,
I have removed the part that was causing problems. It seems to work now.
I'll be away next week from tuesday to tuesday : I won't leave any
uncommitted content so you can modify my patch if needed.
Regards
Viviane
2011/4/10 Florent Hivert :
> Hi There,
>
> Since Nicolas Borie added is
I seem to have similar issues :
I am still with sage-4.6.2, I did a hg pull and hg update and then
tried to pop and push all the patches and here's what I get :
applying trac_10998-categories-posets-nt.patch
unable to find 'sage/categories/facade_sets.py' for patching
2 out of 2 hunks FAILED -- s
Hi all,
I just installed sage-4.7 and my patches apply but don't work, I get
this error :
sage: A = AbstractPolynomialRing(QQ)
sage: from sage.combinat.multivariate_polynomials.basis import Bases
sage: B = Bases(A)
---
Import
iery :
> On Mon, Jun 06, 2011 at 10:57:38AM +0200, Viviane Pons wrote:
>> Hi all,
>>
>> I just installed sage-4.7 and my patches apply but don't work, I get
>> this error :
>>
>> sage: A = AbstractPolynomialRing(QQ)
>> sage: from sage.combinat
Hi everyone,
I just came across a big "zero" problem on my patch and I was
wondering where it was coming from.
Here is what I have
sage: A = AbstractPolynomialRing(QQ)
sage: m = A.monomial_basis()
sage: (0 * m[1,2]) == 0
False
By comparing sage versions (because, it was working before), it seem
Are you fixing it yourself ? It would be difficult for me to it as I
leave tomorrow morning !
2011/6/7 Nicolas M. Thiery :
> Hi Vivianne, Christian, and all free module fans,
>
> On Tue, Jun 07, 2011 at 11:44:07AM +0200, Viviane Pons wrote:
>> I just came across a big "
it's working !
Thank's, now that it seems ok, I won't do any pull before the presentation !
Nicolas, I already have my demo file as a notebook file, how do I get
it as a python test file ?
Regards
Viviane
2011/6/7 Christian Stump :
> I commit the change -- I now do
>
> if D != {}:
>
/4 Florent Hivert
> Hi
>
> > I recently installed sage 4.7 and combinat, but I could not use
> > Viviane Pons' patch
> > for multivariate polynomials. I was wondering if the experts here
> > could help me
> > solve the problem. Thank you very much!
nly
>> windows. There was a problem with using your patch after the
>> installation, and Nicolas solved it.
>>
>> Now I switch to linux and installed sage-combinat myself.
>> But I met the same problem with your patch.
>> I don't know if it's related to Franco
The sage-combinat install did not work well, it seems that you need an hg
username, but I thought that was not needed for the install itself, can
anyone clarify ?
Regards
Viviane
2011/7/6 Jia Huang
> Hi Franco,
>
> jia@jia-laptop:~/sage$ sudo ./sage -combinat update
> Switching to sage combin
6/2 - 10/2 is ok for me. But I need to know that this is fixed as I need to
reschedule some classes.
See you
Viviane
2011/12/13 Nicolas M. Thiery
> On Tue, Dec 13, 2011 at 09:37:03AM +0100, Florent Hivert wrote:
> > [X] 6/2-10/2
> > [ ] 27/2- 2/2 I'll be skiing. You too Florent actually :
Hi everyone,
where are we on the matter of the week in Cernay ? I really need to know
when this is happening as I have some classes to organize !!
See You
Viviane
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To post to this group, s
Hi,
About your bug, I don't know if someone is looking after
SchubertPolynomialRing, from what I see it is mostly sent to symmetrica. I
see what is causing the problem, when creating an element, the index is
sent to Permutation_class which doesn't check if the list is a valid
permutation.
When I
It will also slow things for SchubertPolynomialRing if we do the check for
each new element. The problem is that when the permutation is not correct
and someone try to expand the polynomial, then instead of doing a usual
exception, it stops the program ! I think it comes from something with
symmetr
I can do it but I'm not sure when...
2012/3/6 Nicolas M. Thiery :
> Dear Viviane,
>
> On Mon, Mar 05, 2012 at 03:39:39PM +0100, Viviane Pons wrote:
>> About your bug, I don't know if someone is looking after
>> SchubertPolynomialRing, from what I see
Hi Vivace,
it would be great if you worked on that. some of it has already be
done in the patch trac_11571_catalan_objects-nm.patch
the files are in sage/combinat/catalan
it has been written by Nevena Milojkovic who was a student in
Marne-la-Vallee. She didn't stay and is no longer working on it
Hi Nicolas,
some questions :
On what version of sage should we be developing ?
is Sage 5 supposed to arrive soon ?
Thank's
Viviane
2012/4/6 Nicolas M. Thiery :
>
> For the record: the Sage-Combinat queue now applies smoothly on Sage
> 5.0.beta12.
>
> Cheers,
>
Hi everyone,
I just noticed that the default basis ring for ambient space has been
changed to cyclotomic field. I don't know the reason behind that but
it doesn't seem handy !
In my case, I use the elements of the ambient space to index another
combinatorial free module and it is a pain that thei
Ok, well in the mean time I will force the field to be QQ on my hand.
But I think a long end solution would be to do some test on the root
system type to decide what is the best field.
Cheers
Viviane
2012/5/8 Christian Stump :
> Hi Viviane,
>
>> This type of thing just broke my entire patch on m
I have created the ticket and the patch and fixed the problem : it now
needs to be reviewed, any volunteer ?
Cheers
Viviane
2012/3/15 Viviane Pons :
> I can do it but I'm not sure when...
>
> 2012/3/6 Nicolas M. Thiery :
>> Dear Viviane,
>>
>> On Mon,
Hi everyone,
this patch is breaking Ambient spaces which breaks my patch for
example, and probably lots of other stuff... I'm not sure what the
problem is, so can somebody have a look or disable the patch if the
person is not available (I did it on my local copy but I didn't want
to push it becaus
Thank you Franco, this is fixed !
2012/5/25 Franco Saliola :
> Hello Viviane,
>
> On Fri, May 25, 2012 at 6:16 AM, Viviane Pons wrote:
>> Hi everyone,
>>
>> this patch is breaking Ambient spaces which breaks my patch for
>> example, and probably lots of oth
Hi everyone,
I was wondering if some of you were attending the next FPSAC in Nagoya
and would be interested in organizing some informal sage presentations
with a sage install party as well. It wouldn't be part of the official
"software presentations" but I'm sure it is possible. As Florent and
Nic
As I have seen, the software demo is on the tuesday night before the
poster session but there is no time for the install party there.
Is it to late to it after the poster session on the Monday ? Is the
venue open in the evening ?
Thank's for asking anyway !
Viviane
2012/6/29 Christian Stump :
>
27;re presenting during the week), it is a good time to
present it briefly. Please, let me know !
See you all there
Viviane
2012/6/29 Viviane Pons :
> As I have seen, the software demo is on the tuesday night before the
> poster session but there is no time for the install party there.
>
> Is
.ac.jp/~numata/nora/sage/5/
> [2] http://goo.gl/g6Kh7
>
> Cheers,
> Yas.
>
> 2012/7/3 Viviane Pons :
>> Ok I just got an answer for professor Soichi Okada. The venue is open
>> up to 8 PM. So I propose to do an install party on the Monday night
>> after the
Non symmetric mac donald polynomials are also implemented in
sage-combinat in a more general patch on multivariate polynomials.
This is done by Lascoux's formula using divided differences, but as I
am not a specialist I have not tested this part much.
You can see how the whole patch work on my web
affine case as well!
>
> Best,
>
> Anne
>
> On 8/30/12 6:37 AM, Viviane Pons wrote:
>> Non symmetric mac donald polynomials are also implemented in
>> sage-combinat in a more general patch on multivariate polynomials.
>> This is done by Lascoux's formula using
Hi everyone,
I'm trying to work with trees but I find them quite difficult to use.
I have a simple question : how can I crate a temporary mutable
labelled rooted tree and set it to be immutable after the construction
is finished ?
I have found no way of doing this and this would be necessary for
for ... :
2012/9/3 Nicolas M. Thiery :
> On Mon, Sep 03, 2012 at 06:57:44PM +0200, Viviane Pons wrote:
>> I'm trying to work with trees but I find them quite difficult to use.
>> I have a simple question : how can I crate a temporary mutable
>> labelled rooted tree and s
hout asking me)
2012/9/3 Viviane Pons :
> I'm working with LabelledRootedTree but my problem is that I need to
> create first all the nodes and then an algorithm creates connection
> parent-child. It is something like that:
>
> for v in g.vertices():
> nodes[v] = LabelledRooted
[:-1]]=trees([],None)
>
> Tant qu'on est dans le "with" l'arbre est mutable
>
> Frederic
>
>
> Le lundi 3 septembre 2012 18:57:51 UTC+2, Viviane Pons a écrit :
>>
>> Hi everyone,
>>
>> I'm trying to work with trees but I find the
Hi,
I think what you're looking for is the parameter ``monomial_cmp`` of
combinatorial free module. When you create your module, you can give a
comparison function between elements so that they are sorted the way
you want.
Cheers
Viviane
2013/1/14 Frédéric Chapoton :
> Hello,
>
> I would like t
If ever, you can't get sage-combinat to work. I put instructions on my
website on how to install the patch on its own:
http://www-igm.univ-mlv.fr/~pons/en/prog.php
2013/5/29 Nicolas M. Thiery
> On Wed, May 29, 2013 at 10:26:21AM -0700, Dan Betea wrote:
> >This seemed to have been asked bef
Hi everyone,
I guess this subject has already been discussed somewhere but I'm not aware
of it so I'm asking the question here.
Looking into hash functions, I discovered that many combinatorial objects
have weird equality between them. Basically: if they are equal as lists,
they are considered eq
92 matches
Mail list logo
