English
Related papers

Related papers: The method of creative microscoping

200 papers

We present efficient methods for calculating linear recurrences of hypergeometric double sums and, more generally, of multiple sums. In particular, we supplement this approach with the algorithmic theory of contiguous relations, which…

Symbolic Computation · Computer Science 2024-01-30 Peter Paule , Carsten Schneider

Employing a quadratic transformation formula of Rahman and the method of `creative microscoping' (introduced by the author and Zudilin in 2019), we provide some new $q$-supercongruences for truncated basic hypergeometric series. In…

Number Theory · Mathematics 2022-01-19 Victor J. W. Guo

In recent years, Z.-W. Sun proposed several sophisticated conjectures on congruences for finite sums with terms involving combinatorial sequences such as central trinomial coefficients, Domb numbers and Franel numbers. These sums are double…

Number Theory · Mathematics 2017-11-28 Yan-Ping Mu , Zhi-Wei Sun

A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…

Classical Analysis and ODEs · Mathematics 2011-10-26 Armen Bagdasaryan

We develop a theoretical study of non-terminating hypergeometric summations with one free parameter. Composing various methods in complex and asymptotic analysis, geometry and arithmetic of certain transcendental curves and rational…

Classical Analysis and ODEs · Mathematics 2017-09-08 Katsunori Iwasaki

In this paper we will relate hyperstructures and the general $\mathscr{H}$-principle to known mathematical structures, and also discuss how they may give rise to new mathematical structures. The main purpose is to point out new ideas and…

General Mathematics · Mathematics 2019-05-15 Nils A. Baas

Creative telescoping is the method of choice for obtaining information about definite sums or integrals. It has been intensively studied since the early 1990s, and can now be considered as a classical technique in computer algebra. At the…

Symbolic Computation · Computer Science 2016-09-14 Shaoshi Chen , Manuel Kauers

In this paper, we investigate a number of $q$-supercongruences on double and triple sums. By means of a lemma devised by El Bachraoui and its generalization, we transform some $q$-supercongruences on double and triple sums into the…

Number Theory · Mathematics 2021-12-21 Xiaoxia Wang , Chang Xu

Based on a modified version of Abramov-Petkov\v{s}ek reduction, a new algorithm to compute minimal telescopers for bivariate hypergeometric terms was developed last year. We investigate further in this paper and present a new argument for…

Symbolic Computation · Computer Science 2016-05-16 Hui Huang

Creative telescoping is an algorithmic method initiated by Zeilberger to compute definite sums by synthesizing summands that telescope, called certificates. We describe a creative telescoping algorithm that computes telescopers for definite…

Symbolic Computation · Computer Science 2023-11-21 Hadrien Brochet , Bruno Salvy

By examining asymptotic behavior of certain infinite basic ($q$-) hypergeometric sums at roots of unity (that is, at a "$q$-microscopic" level) we prove polynomial congruences for their truncations. The latter reduce to non-trivial…

Number Theory · Mathematics 2019-02-14 Victor J. W. Guo , Wadim Zudilin

Congruences of truncated sums of infinite series do not directly extend to congruences of the truncated sums of higher powers of these infinite series. Guo and Zudilin recently established a variety of supercongruences for truncated sums of…

Number Theory · Mathematics 2019-11-26 Mohamed El Bachraoui

In a recent paper (Appl. Math. Comput. 215, 1622--1645, 2009), the authors proposed a method of summation of some slowly convergent series. The purpose of this note is to give more theoretical analysis for this transformation, including the…

Numerical Analysis · Mathematics 2016-09-06 Rafał Nowak , Paweł Woźny

A supercongruence is a congruence between rational numbers modulo a power of a prime. In this paper, we give a technique for finding and algorithmically proving supercongruences by expressing terms as infinite series involving certain…

Number Theory · Mathematics 2017-06-22 Julian Rosen

We adapt the theory of normal and special polynomials from symbolic integration to the summation setting, and then built up a general framework embracing both the usual shift case and the $q$-shift case. In the context of this general…

Symbolic Computation · Computer Science 2025-07-29 Shaoshi Chen , Hao Du , Yiman Gao , Hui Huang , Ziming Li

Usually creative telescoping is used to derive recurrences for sums. In this article we show that the non-existence of a creative telescoping solution, and more generally, of a parameterized telescoping solution, proves algebraic…

Symbolic Computation · Computer Science 2008-09-02 Carsten Schneider

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

Discrete Mathematics · Computer Science 2008-06-20 Tsiriniaina Andriamampianina

We showcase a collection of practical strategies to deal with a problem arising from an analysis of integral estimators derived via quasi-Monte Carlo methods. The problem reduces to a triple binomial sum, thereby enabling us to open up the…

Symbolic Computation · Computer Science 2021-07-27 Christoph Koutschan , Elaine Wong

We review "creative" strategies of closed-form evaluations of hypergeometric functions.

Classical Analysis and ODEs · Mathematics 2025-12-02 Wadim Zudilin

We propose a way to split a given bivariate P-recursive sequence into a summable part and a non-summable part in such a way that the non-summable part is minimal in some sense. This decomposition gives rise to a new reduction-based creative…

Symbolic Computation · Computer Science 2023-11-10 Shaoshi Chen , Lixin Du , Manuel Kauers , Rong-Hua Wang
‹ Prev 1 2 3 10 Next ›