Abstract
Using a recent method of Pemantle and Wilson, we study the asymptotics of a family of combinatorial sums that involve products of two binomial coefficients and include both alternating and non-alternating sums. With the exception of finitely many cases the main terms are obtained explicitly, while the existence of a complete asymptotic expansion is established. A recent method by Flajolet and Sedgewick is used to establish the existence of a full asymptotic expansion for the remaining cases, and the main terms are again obtained explicitly. Among several specific examples we consider generalizations of the central Delannoy numbers and their alternating analogues.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
