Le lundi 25 juillet 2011 à 04:47 -0700, Martin Raum a écrit : > Hello all,
Hello Martin, > I happened to think about Sidon g-sets and to do some computations I > implemented a recursive enumeration of such sets. Clearly, this would > go into the combinatorics tree. I am not an expert in combinatorics. > Since the code doesn't seem to fit in any of the files in sage/ > combinat, please could anybody point out the right place put it? I > will then open a ticket with an according patch. Creating a new file sidon_sets.py in root_sage/sage/combinat/ seems a nice solution for such an enhancement. There are a lot of files inside the folder but I think it is the first place anybody would search in first. Although a lot of people are in holidays, if you need more advises for this implementation, you can also post to the sage-combinat-devel google group. Cheers, Nicolas B. -- 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@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
