I have gone through all the modules which you have developed and included in SymPy and then studied them deeply. Firstly I would like to appreciate your efforts which you and your whole team have put continuously since last decade. All the modules are giving so* efficient and quality result*, that they may not be optimized further. The codes which you have implemented in all of your modules are already so much optimized that might not need any corrections further. That is why I want to work on some* new parameters* which are not yet taken or are not given much importance. For taking this whole thing to much higher level I may need your help in various upcoming challenges. One such topic which may be taken for higher analysis and making it a part of SymPy organization is, *Collaborative Study Of Fourier Transform and Music/Image file(.mp3/.jpeg)* compression and expansion. I have gone through this topic and collected various references from some authorized sources too. Another interesting thing which we can add to the modules is finding *Minimum Spanning Tree* and* Shortest Distance* which are based on discrete mathematics. Therefore, I would like to get your opinion regarding this idea as one of the *project for GSoC2017*. Both of the topics are one of the most trending ones nowaday having hundreds of applications(still counting) in every field of mathematics. Not only Mathematics, in various other fileds too i.e it's *scope* is increasing *exponentially*. Further documents and references can be *provided* on request.
-- You received this message because you are subscribed to the Google Groups "sympy" 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/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/8b9c80bb-0390-46e3-85ee-6533f07526ed%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
