Related papers: Partial-Fraction Decompositions and Harmonic Numbe…
We discuss some aspects of the search for identities using computer algebra and symbolic methods. The focus is on so-called Apery-like formulae for special values of the Riemann Zeta function. Much work lays ahead in formally proving and…
We describe a general operational method that can be used in the analysis of fractional initial and boundary value problems with additional analytic conditions. As an example, we derive analytic solutions of some fractional generalisation…
An algorithm is designed which decomposes a tropical univariate rational function into a composition of tropical binomials and trinomials. When a function is monotone, the composition consists just of binomials. Similar algorithms are…
Motivated by rigorous development in the theory of digamma functions, we have first derived some new identities for the digamma function, and then computed the values of digamma function for the fractional orders using these identities…
In this paper we propose an algorithm for the numerical solution of arbitrary differential equations of fractional order. The algorithm is obtained by using the following decomposition of the differential equation into a system of…
A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…
We provide lower bounds for p-adic valuations of multisums of factorial ratios which satisfy an Ap\'ery-like recurrence relation: these include Ap\'ery, Domb, Franel numbers, the numbers of abelian squares over a finite alphabet, and…
Recently, using modular forms F. Beukers posed a unified method that can deal with a large number of supercongruences involving binomial coefficients and Ap\'ery-like numbers. In this paper, we use Beukers' method to prove some conjectures…
The applications of the partial fraction decomposition in control and systems engineering are several. In this letter, we propose a new interpretation of residues in the partial fraction decomposition, which is employed for the following…
The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A…
In terms of the telescoping method, a simple binomial sum is given. By applying the derivative operators to the equation just mentioned, we establish several general harmonic number identities including some known results.
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombination strategy is the used of Darboux polynomials. We study…
We explore a novel link between two seemingly disparate mathematical concepts: Egyptian fractions and fractals. By examining the decomposition of rationals into sums of distinct unit fractions, a practice rooted in ancient Egyptian…
We use both Abel's lemma on summation by parts and Zeilberger's algorithm to find recurrence relations for definite summations. The role of Abel's lemma can be extended to the case of linear difference operators with polynomial…
We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…
Recently, Chen, Hou and Jin used both Abel's lemma on summation by parts and Zeilberger's algorithm to generate recurrence relations for definite summations. Meanwhile, they proposed the Abel-Gosper method to evaluate some indefinite sums…
Any rational number can be written as the sum of distinct unit fractions. In this survey paper we review some of the many interesting questions concerning such 'Egyptian fraction' decompositions, and recent progress concerning them.
We discuss reflections identities of harmonic sums up to weight three. The need for this kind of identities emerges in analysis of the general structure of eigenvalue of the BFKL equation. The reflection identities decompose a product of…
I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a…
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…