Multiple binomial sums
From MaRDI portal
Publication:346550
DOI10.1016/J.JSC.2016.04.002zbMATH Open1351.05013arXiv1510.07487OpenAlexW2964136158MaRDI QIDQ346550FDOQ346550
Authors: Alin Bostan, Pierre Lairez, Bruno Salvy 
Publication date: 29 November 2016
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Abstract: Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with algebraic generating function. We study the representation of the generating functions of binomial sums by integrals of rational functions. The outcome is twofold. Firstly, we show that a univariate sequence is a multiple binomial sum if and only if its generating function is the diagonal of a rational function. Secondly, we propose algorithms that decide the equality of multiple binomial sums and that compute recurrence relations for them. In conjunction with geometric simplifications of the integral representations, this approach behaves well in practice. The process avoids the computation of certificates and the problem of the appearance of spurious singularities that afflicts discrete creative telescoping, both in theory and in practice.
Full work available at URL: https://arxiv.org/abs/1510.07487
Recommendations
- scientific article; zbMATH DE number 89389
- Sums of Multinomial Coefficients
- scientific article
- On sums involving binomial coefficients
- ON SUMS OF BINOMIAL COEFFICIENTS
- Sums of powers of binomial coefficients
- Calculation of binomial and multinomial coefficients by sequences of summations
- scientific article; zbMATH DE number 3914325
- Partial sums of binomial coefficients
Symbolic computation and algebraic computation (68W30) Factorials, binomial coefficients, combinatorial functions (05A10) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)
Cites Work
- GFUN
- A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
- Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory
- Title not available (Why is that?)
- A holonomic systems approach to special functions identities
- Algebraic functions over finite fields
- Points entiers dans les polyèdres convexes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Diagonals of rational fractions
- On the De Rham cohomology of algebraic varieties
- D-finite power series
- A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3)
- Title not available (Why is that?)
- Nilpotent connections and the monodromy theorem: Applications of a result of Turrittin
- Analytic combinatorics in several variables.
- Creative telescoping for rational functions using the Griffiths-Dwork method
- A fast approach to creative telescoping
- Integer points in polyhedra
- Binomial identities -- combinatorial and algorithmic aspects
- An extension of Zeilberger's fast algorithm to general holonomic functions
- An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
- Hypergeometric solutions of linear recurrences with polynomial coefficients
- On Ordered Division Rings
- The method of creative telescoping
- Title not available (Why is that?)
- \(G\)-functions and multisum versus holonomic sequences
- The diagonal of a D-finite power series is D-finite
- Some questions concerning computer-generated proofs of a binomial double- sum identity
- On the structure of multivariate hypergeometric terms.
- An algorithm for finding recurrence relations of binomial sums and its complexity
- On the non-holonomic character of logarithms, powers, and the \(n\)th prime function
- Computing periods of rational integrals
- Some binomial sums involving absolute values
- On the summation of \(P\)-recursive sequences
- Symbolic-Numeric Tools for Analytic Combinatorics in Several Variables
- Integral Representation and Algorithms for Closed Form Summation
- A new algorithm for the recursion of hypergeometric multisums with improved universal denominator
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraically Closed Fields Analogous to Fields of Puiseux Series
- Title not available (Why is that?)
- Ising \(n\)-fold integrals as diagonals of rational functions and integrality of series expansions
- Creative telescoping for holonomic functions
- Gosper's algorithm, accurate summation, and the discrete Newton-Leibniz formula
- Hadamard grade of power series
- A residue theorem for Malcev-Neumann series.
- Effective bounds for P-recursive sequences
Cited In (20)
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
- New Representations for all Sporadic Apéry-Like Sequences, With Applications to Congruences
- Diagonal representation of algebraic power series: a glimpse behind the scenes
- Single-scale diagrams and multiple binomial sums
- Generating functions for series involving higher powers of inverse binomial coefficients and their applications
- Discrete analogues of Macdonald-Mehta integrals
- Evaluation of Binomial Double Sums Involving Absolute Values
- Monodromie unipotente maximale, congruences “à la Lucas” et indépendance algébrique
- On congruence schemes for constant terms and their applications
- Seven equivalent binomial sums
- Mixed binomial sum identities
- Constructing minimal telescopers for rational functions in three discrete variables
- Minimization of differential equations and algebraic values of 𝐸-functions
- Title not available (Why is that?)
- Reduction-based creative telescoping for Fuchsian D-finite functions
- Linear differential equations as a data structure
- Multisection of series
- Sequence positivity through numeric analytic continuation: uniqueness of the Canham model for biomembranes
- Generating functions for finite sums involving higher powers of binomial coefficients: analysis of hypergeometric functions including new families of polynomials and numbers
- Creative telescoping on multiple sums
Uses Software
This page was built for publication: Multiple binomial sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q346550)
