I am fourth year student at IIT Kanpur in Mathematics and Scientific Computing and I wanted to suggest a project idea that I could work on.
I was going through the documentation for functions related to integer partitions <http://doc.sagemath.org/html/en/reference/combinat/sage/combinat/partition.html> and I realized that there is scope for more functions on partitions. For instance, one could find the residue of the partition function modulo various numbers, implement Rademacher's exact formula, implement Gaussian polynomial which can be used to do things related to restricted partitions and so on. I have done some work in this area by coding up a Haskell open source library for partitions which can be found here <https://bitbucket.org/shehzad_hathi/combinatorial-curry> and an explanation of the work done can be found here <http://home.iitk.ac.in/~shehzad/combinatorial-curry.pdf>. So if I propose the idea of speeding up partitions related functions and implementation of new functions, would the community be interested in it? -- You received this message because you are subscribed to the Google Groups "sage-gsoc" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-gsoc. For more options, visit https://groups.google.com/d/optout.
