English
Related papers

Related papers: Telescoping method, derivative operators and harmo…

200 papers

Hou and Liu developed a telescoping method to prove the congruence of partial sums of P-recursive sequences. We release the requirement on the telescoper and utilize the congruence of the sequence. With this approach, we are able to confirm…

Combinatorics · Mathematics 2023-12-22 Qing-Hu Hou , Na Li

In this note we reinvestigate the task of computing creative telescoping relations in differential-difference operator algebras. Our approach is based on an ansatz that explicitly includes the denominators of the delta parts. We contribute…

Symbolic Computation · Computer Science 2011-06-28 Christoph Koutschan

We present a review of data types and statistical methods often encountered in astronomy. The aim is to provide an introduction to statistical applications in astronomy for statisticians and computer scientists. We highlight the complex,…

Physics Education · Physics 2017-10-23 James P. Long , Rafael S. de Souza

A complete reduction on a difference field is a linear operator that enables one to decompose an element of the field as the sum of a summable part and a remainder such that the given element is summable if and only if the remainder is…

Symbolic Computation · Computer Science 2025-06-11 Shaoshi Chen , Yiman Gao , Hui Huang , Carsten Schneider

Telescopers for a function are linear differential (resp. difference) operators annihilated by the definite integral (resp. definite sum) of this function. They play a key role in Wilf-Zeilberger theory and algorithms for computing them…

Symbolic Computation · Computer Science 2021-01-20 Shaoshi Chen , Ruyong Feng , Ziming Li , Michael F. Singer , Stephen Watt

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

A generalization of the Chu-Vandermonde convolution is presented and proved with the integral representation method. This identity can be transformed into another identity, which has as special cases two known identities. Another identity…

Combinatorics · Mathematics 2021-10-27 M. J. Kronenburg

We extend Zeilberger's approach to special function identities to cases that are not holonomic. The method of creative telescoping is thus applied to definite sums or integrals involving Stirling or Bernoulli numbers, incomplete Gamma…

Symbolic Computation · Computer Science 2013-06-19 Frédéric Chyzak , Manuel Kauers , Bruno Salvy

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

Mathematical Physics · Physics 2007-05-23 Mark W. Coffey

We establish two binomial coefficient--generalized harmonic sum identities using the partial fraction decomposition method. These identities are a key ingredient in the proofs of numerous supercongruences. In particular, in other works of…

Number Theory · Mathematics 2012-04-10 Dermot McCarthy

The theory of harmonic based function is discussed here within the framework of umbral operational methods. We derive a number of results based on elementary notions relying on the properties of Gaussian integrals.

Classical Analysis and ODEs · Mathematics 2017-07-18 Giuseppe Dattoli , Bruna Germano , Silvia Licciardi , Maria Renata Martinelli

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

We derived the sum identities for generalized harmonic and corresponding oscillatory numbers for which a sieve procedure can be applied. The obtained results enable us to understand better the properties of these numbers and their…

Number Theory · Mathematics 2007-09-24 R. M. Abrarov , S. M. Abrarov

Some finite series of harmonic numbers involving certain reciprocals are evaluated. Products of such reciprocals are expanded in a sum of the individual reciprocals, leading to a computer program. A list of examples is provided.

Number Theory · Mathematics 2012-03-08 Maarten Kronenburg

The derivation of spherical harmonics is the same in nearly every quantum mechanics textbook and classroom. It is found to be difficult to follow, hard to understand, and challenging to reproduce by most students. In this work, we show how…

Quantum Physics · Physics 2018-09-28 M. Weitzman , J. K. Freericks

We compute the sum and the alternating sum of the reciprocals of triangular numbers using two standard methods from calculus: a telescoping series approach and a power series approach. We then extend these results to generalized…

Number Theory · Mathematics 2026-02-06 Pawel Grzegrzolka , Jeffrey L. Meyer

The process of identifying stars is integral toward stellar based orientation determination in spacecraft. Star identification involves matching points in an image of the sky with stars in an astronomical catalog. A unified framework for…

Data Structures and Algorithms · Computer Science 2018-08-28 Glenn Galvizo , Lipyeow Lim

We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…

Probability · Mathematics 2022-10-20 Zhaoyang Shi , Krishnakumar Balasubramanian , Wolfgang Polonik

A new method for absolute polarimetric calibration of large telescopes is presented. The proposed method is highly accurate and is based on the calibration of a small sub-aperture, which is then extended to the full system by means of…

Astrophysics · Physics 2009-11-10 H. Socas-Navarro

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…

Symbolic Computation · Computer Science 2023-06-12 Alin Bostan , Pierre Lairez , Bruno Salvy