The PR, https://github.com/sympy/sympy/pull/14701 might be of interest. It
implements an algorithm for computing hypergeometric sums.
On Fri, Mar 13, 2020 at 9:32 AM Neeraj Adhikari
wrote:
> I couldn't find any examples in open issues which require the generating
> function algorithm to solve.
I couldn't find any examples in open issues which require the generating
function algorithm to solve. I will keep looking at the issues and the
codebase to better understand them.
As for the Karr Algorithm, thank you for the suggestion! I will split its
implementation to smaller pieces and
Yes, I just looked closer and what is written there is quite
confusing. The purpose of the convention is to define what happens
when the upper limit is less than the lower limit. I believe it also
defines what happens when the limits are nonintegral, but I could be
misremembering that. The
On Wed, 11 Mar 2020 at 16:58, Aaron Meurer wrote:
>
> The convention used is actually related to the Karr algorithm, in that
> it is based on the conventions defined in his paper
> https://docs.sympy.org/latest/modules/concrete.html#sympy.concrete.summations.Sum.
> It relates to the way so-called
The convention used is actually related to the Karr algorithm, in that
it is based on the conventions defined in his paper
https://docs.sympy.org/latest/modules/concrete.html#sympy.concrete.summations.Sum.
It relates to the way so-called indefinite summations work, which are
an important part of
Hi Neeraj,
That all sounds excellent. I don't know the algorithms you are
referring to or the summation code that well myself but I know that it
needs some love!
A GSOC proposal is always more enticing if it demonstrates
understanding of the existing codebase and known problems. It is
probably
Hello SymPy Developers,
I am interested in applying to GSoC 2020 so here's my introduction.
I'm a grad student at the University of Rhode Island, currently in my
second semester pursuing a Master's Degree in Computer Science. I have
strong interests in mathematics in general and specifically
