2000 character limit reached
On an identity by Ercolani, Lega, and Tippings
Published 17 Jan 2024 in math.CA | (2401.09562v1)
Abstract: In this note we prove that [ j!\,2N \, \binom{N+j-1}{j} \, {}2F_1\left(\begin{matrix}-j,-2j \ -N-j+1 \end{matrix};-1\right) = \sum{l=0}N \binom{N}{l}\prod_{i=0}{j-1}2(2i+1+l), ] where $ N $ and $ j $ are positive integers, which resolves a question posed by Ercolani, Lega, and Tippings.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.