Identities by Generalized $L-$Summing Method
Mehdi Hassani, Zahra Jafari

TL;DR
This paper introduces a 3-dimensional $L$-summing method for rearranging sums, deriving identities involving special functions like the Riemann zeta and digamma functions, and extends the method to higher dimensions.
Contribution
The paper presents a novel 3D $L$-summing technique, provides a Maple implementation, and generalizes the method to higher-dimensional spaces.
Findings
Derived identities involving the Riemann zeta and digamma functions.
Provided a Maple program for automating the $L$-summing method.
Extended the $L$-summing method to higher dimensions.
Abstract
In this paper, we introduce 3-dimensional summing method, which is a rearrangement of the summation with . Applying this method on some special arrays, we obtain some identities on the Riemann zeta function and digamma function. Also, we give a Maple program for this method to obtain identities with input various arrays and out put identities concerning some elementary functions and hypergeometric functions. Finally, we introduce a further generalization of summing method in higher dimension spaces.
Click any figure to enlarge with its caption.
Figure 1
Figure 2Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques
Identities by Generalized Summing Method
M. Hassani
Mehdi Hassani,
Department of Mathematics, Institute for Advanced Studies in Basic Sciences, P.O. Box 45195-1159, Zanjan, Iran
and
Z. Jafari
Zahra Jafari,
Department of Information Technology, Institute for Advanced Studies in Basic Sciences, P.O. Box 45195-1159, Zanjan, Iran
[email protected], [email protected]
Abstract.
In this paper, we introduce 3-dimensional summing method, which is a rearrangement of the summation with . Applying this method on some special arrays, we obtain some identities on the Riemann zeta function and digamma function. Also, we give a Maple program for this method to obtain identities with input various arrays and out put identities concerning some elementary functions and hypergeometric functions. Finally, we introduce a further generalization of summing method in higher dimension spaces.
Key words and phrases:
Summing Method
2000 Mathematics Subject Classification:
65B10
1. Introduction and Motivation
Consider the following multiplication table
If we set for the sum of all numbers in it, then by summing line by line we have . On the other hand, we can find by using another method; letting be the sum of numbers in the rotated in above table (right part of Figure 1), we have
[TABLE]
We call , summing element. Thus we get , and therefore . This is 2-dimensional *L-*summing method (applied on the array ), which briefly is
[TABLE]
More precisely, the summing method of elements of array with , is the following rearrangement
[TABLE]
This method allows to obtain easily some classical algebraic identities and also, with help of MAPLE, some new compact formulas for sums related with the Riemann zeta function, the gamma function and the digamma function [2, 3].
In this paper we introduce a 3-dimensional version of summing method for arrays and applying it on some special arrays we obtain some identities concerning the Riemann zeta function and digamma function. Then, we give a Maple program for this method and using it we generate and then proof some new identities, concerning some elementary functions and hypergeometric functions. Finally, we introduce a further generalization of summing method in higher dimension spaces and for latices related by a manifold.
2. Formulation of the summing method in
Consider a three dimensional array with and is a positive integer. We should prepare an explicit version of the general formulation (1.1) for this array. The summation of all entries is . The summing elements in this array have the form pictured bellow
So, we have , with
[TABLE]
Therefore, summing method in take the following formulation
[TABLE]
Note that is the sum of entries in three faces, is the sum of entries in three intersected edges and is the end point of all faces and edges.
If the array is symmetric, that is for each permutation it satisfies , then summing elements in takes the following easier form
[TABLE]
In the next section we will apply 3-dimensional summing method on two special symmetric arrays, related by the Riemann zeta function and digamma function.
3. Arrays related by the Riemann zeta function and digamma function
3.1. The Riemann zeta function
Suppose and let . It is clear that
[TABLE]
where . Since this array is symmetric, considering (2.2), we have
[TABLE]
and an easy simplifying, we can reform as follows
[TABLE]
Note that if , then , where is the well-known Riemann zeta function defined for complex values of with and admits a meromorphic continuation to whole complex plan [5]. So, for we have
[TABLE]
which also is true for other values of by meromorphic continuation, except and .
3.2. Digamma function
Setting in (3.1) (or equivalently taking ) and considering , we obtain
[TABLE]
One can state this identity in sense of digamma function , with is the well-known gamma function. Considering logarithmic derivative of the formula , we obtain
[TABLE]
and applying this relation, we yield that . Thus, we have
[TABLE]
in which is the Euler constant [1]. Therefore, we obtain
[TABLE]
Letting
[TABLE]
the following identity [3] is a result of 2-dimensional summing method
[TABLE]
where is called polygamma function [1] and we have , which is special case of the following identity
[TABLE]
and using it in (3.1) one can get a generalization of (3.4), however this relation itself is the key of getting an analogue of (3.5) in , stated bellow.
Theorem 3.1**.**
For every integer , we have
[TABLE]
Proof.
We begin from the left hand side of the identity (3.4); simplifying it by the relations (3.2), (3.3) and the relation (3.6) with , gives the result. ∎
Corollary 3.2**.**
For every integer , we have
[TABLE]
In above corollary, the main term in the right hand side is . Also, we note that the summation is converges. Thus, we can write the following asymptotic relation
[TABLE]
Similarly, considering (3.5) we have
[TABLE]
Note and Problem. It is interesting to find an explicit (probably recurrence) relation for the function . Considering two above asymptotic relations, we guess that
[TABLE]
One can attack to this problem considering generalization of summing method in higher dimension spaces, pointed in the last section of this paper.
4. Generating some new identities by Maple and 3-dimension summing
method
Appendix of this paper includes Maple program of 3-dimension summing method. By , we call the identity outputted by Summing method’s Maple program with input . The algorithm of this program is result of the formulation of 3-dimension summing method in above sections. In this program we input a 3-dimensional array , then out put is an identity generated by Maple. In this section we will state some of these identities, with handling a detailed proof.
4.1. Some elementary functions
Proposition 4.1**.**
We have
[TABLE]
Proof.
Considering the relations (2.1) and , we have . Also, , and . Putting these relations in (2.1) yields as desired. ∎
Corollary 4.2**.**
We have
[TABLE]
Proof.
Breaking up the statement under the summation obtained from in Proposition 4.1, into the sum of and , and considering the Proposition 6 of [3], which states
[TABLE]
completes the proof. ∎
Remark 4.3*.*
Examining Maple code of expressed summation on above corollary, one can see that Maple has no comment on the computing this summation; however, it is obtained by Maple itself and summing method. This example shows that program-writers of Maple can add summing method in the summation package of this software, in order to making it able to compute some summations which already couldn’t compute them.
Proposition 4.4**.**
A little simplifying , we have
[TABLE]
where .
Proof.
Considering the relation (2.1), we have . Also, , and , and consequently . This completes the proof. ∎
4.2. Hypergeometric functions
In the next proposition, we introduce an identity concerning hypergeometric functions, denoted in Maple by . Standard notation and definition [6] is as follows
[TABLE]
where
[TABLE]
Proposition 4.5**.**
A little simplifying and stating in standard notations, we have
[TABLE]
where
[TABLE]
Proof.
Considering definition of hypergeometric functions we have , which implies , say. This gives and in similar way it yields that . Thus, we obtain
[TABLE]
and a easy simplifying this, implies the result. ∎
Remark 4.6*.*
Three last propositions are examples of the array , for some given function . In this case, summing method takes the following form
[TABLE]
where .
5. Further generalizations of the summing method and some comments
5.1. The Summing method in
Consider a dimensional array and let with . The Summing method in is the rearrangement , where and
[TABLE]
where in the inner summation is over with , and the index denotes with . One can apply this generalized version to get more general form of relations obtained in previous sections. For example, considering the array with , yields
[TABLE]
5.2. summing method on manifolds
As in rising of this paper, the base of the summing method is ordinary multiplications table. Above generalization of the Summing method in is based on generalized multiplication tables [4]. But, is a very special -dimensional manifold, and if we replace it with , an dimensional manifold with , then we can define generalized multiplication table on by considering lattice points on it (which of course isn’t easy problem). Let
[TABLE]
and is a function. If is a collection of dimension orthogonal manifolds, in which and for distinct , then we can formulate summing method as follows,
[TABLE]
Here summing elements are . This may be useful when one apply it on some special manifolds.
5.3. Stronger form of summing method
One can state the method of summing in the following stronger form
[TABLE]
Specially, this will be useful for those arrays with computable explicitly and maybe note. For example, applying this note on the array in with , implies
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Abramowitz and I.A. Stegun, HANDBOOK OF MATHEMATICAL FUNCTIONS: with Formulas, Graphs, and Mthematical Tables , Dover Publications, 1972. Available at: http://www.convertit.com/Go/Convert It/Reference/AMS 55.ASP
- 2[2] Jacek Gilewicz (Reviewer), Review of the paper [ 3 ] (in this reference list), Zentralblatt MATH Database , European Mathematical Society, FIZ Karlsruhe & Springer-Verlag, 2007.
- 3[3] M. Hassani, Identities by L-summing Method, Int. J. Math. Comp. Sci. , Vol. 1 (2006) no. 2, 165-172.
- 4[4] M. Hassani, Lattice Points and Multiplication Tables, Int. J. Contemp. Math. Sci. , Vol. 1 (2006) no. 1, 1-2.
- 5[5] Aleksandar Ivic, The Riemann Zeta Function , John Wiley & sons, 1985.
- 6[6] M. Petkovšek, H.S. Wilf and D. Zeilberger, A = B 𝐴 𝐵 A=B , A. K. Peters, 1996. Available at: http://www.cis.upenn.edu/ wilf/Aeq B.html
