Hello,
I certainly encourage more people working on GSL! Though keep in mind
GSL aims to be a general-purpose scientific computing library. I
personally don't work in combinatorics, so its difficult for me to gauge
how many people would benefit / use these new algorithms you propose. If
indeed a large number of users would like to see these algorithms in
GSL, then certainly I would like to add them. However if only a small
number of specialists would be interested, then I would say this work
should be made into an extension library, which is as you say a
self-contained external library which may or may not rely on GSL itself.
Perhaps as a first step you could give some examples of what kinds of
problems people can solve with these algorithms you are planning to code?
Patrick
On 05/31/2018 01:01 PM, Tito Sacchi wrote:
Greetings,
I’d like to start working on some code on integer partitions,
combinatorics, and related algorithms
(Young tableaux, hook lengths...) in a new module that I’d call
“intpart” (or “intparts”, tell me).
I have already read the GSL Homepage which says that “any new
functionality is encouraged as
packages”, but such module isn’t very specific, and creating a package
would signify creating a totally
different library which probably wouldn’t even use any GSL function
(could we call it an extension?);
then we’ll end up with another C library which probably won’t get
integrated into GSL, so I thought
you might be interested in including it directly into the main library
(obviously after testing ecc.).
Just let me know if you prefer that I work on the anonymous clone of
the Savannah repo, or that I
start a separate project, maybe on GitHub.
Yours sincerely,
Tito Sacchi
