Sums of squares of binomial coefficients, with applications to Picard-Fuchs equations
H. A. Verrill
Abstract
For a fixed integer N, and fixed numbers b1,...,bN, we consider sequences, the nth term (an) of which is the sum of the squares of the terms in the expansion of (b1 + ... + bN)n. In the case all bi=1, we give a formula for a recurrence relation for the an. Otherwise we give an algorithm for finding a recurrence relation. As an application, we give the Picard-Fuchs equations for certain families of elliptic curves.
Create a lesson
Related papers
Off-Diagonal Induced Ramsey Numbers
Bruno Andrades, Marcelo Campos, Rafael Filipe et al.
Largest Sperner families with bounded VC-dimension
Gennian Ge, Hanyu Wang, Zixiang Xu et al.
Proof of two conjectures on the log-concavity of partition ranks and cranks
Jianxi Mao, Wenle Shi, Bao-Xuan Zhu
The Exact Number of Pentagons in Book-Free Graphs
Wentao Hu
A family of symmetric counterexamples to the bent sum decomposition conjecture
Máté Róbert Kepes, Anita Kercsó-Molnár, Viczián András
Counting graphs admitting a strictly matched involution
Stephan Dominique Andres, Igor Režan