相关论文: Polynomial reduction for holonomic sequences and a…
Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…
New convolution identities of hypergeometric Bernoulli polynomials are presented. Two different approaches to proving these identities are discussed, corresponding to the two equivalent definitions of hypergeometric Bernoulli polynomials as…
In this paper, we present a $q$-analogue of the polynomial reduction which was originally developed for hypergeometric terms. Using the $q$-Gosper representation, we describe the structure of rational functions that are summable when…
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…
We adopt the "translation" as well as other techniques to express several identities conjectured by Z.-W. Sun in arXiv:1102.5649v47 by means of known formulas for $1/\pi$ involving Domb and other Ap\'ery-like sequences.
We give an extension of Sister Celine's method of proving hypergeometric sum identities that allows it to handle a larger variety of input summands. We then apply this to several problems. Some give new results, and some reprove already…
The origin of this study is based on not only explicit formulas of finite sums involving higher powers of binomial coefficients, but also explicit evaluations of generating functions for this sums. It should be emphasized that this study…
We systematically exploit a new generalized hypergeometric identity to obtain new hypergeometric summation formulas. As a consistency test, alternative proofs for some special cases are also provided. As a byproduct new summation formulas…
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…
Numerical algebraic geometry provides a number of efficient tools for approximating the solutions of polynomial systems. One such tool is the parameter homotopy, which can be an extremely efficient method to solve numerous polynomial…
Given a holonomic sequence $F(n)$, we characterize rational functions $r(n)$ so that $r(n)F(n)$ can be summable. We provide upper and lower bounds on the degree of the numerator of $r(k)$ and show the denominator of $r(n)$ can be read from…
We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…
We consider a special class of binomial sums involving harmonic numbers and we prove three identities by using the elementary method of the partial fraction decomposition. Some applications to infinite series and congruences are given.
We introduce hypergeometric-type sequences. They are linear combinations of interlaced hypergeometric sequences (of arbitrary interlacements). We prove that they form a subring of the ring of holonomic sequences. An interesting family of…
Time-series classification has attracted considerable research attention due to the various domains where time-series data are observed, ranging from medicine to econometrics. Traditionally, the focus of time-series classification has been…
Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution…
An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain…
We propose an algebraic framework generalizing several variants of Prony's method and explaining their relations. This includes Hankel and Toeplitz variants of Prony's method for the decomposition of multivariate exponential sums,…
In this paper we focus on two new families of polynomials which are connected with exponential polynomials and geometric polynomials. We discuss their generalizations and show that these new families of polynomials and their generalizations…
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…