About this Journal Submit a Manuscript Table of Contents
Abstract and Applied Analysis
Volume 2014 (2014), Article ID 289187, 6 pages
http://dx.doi.org/10.1155/2014/289187
Research Article

Euler Polynomials and Combinatoric Convolution Sums of Divisor Functions with Even Indices

1National Institute for Mathematical Sciences, Daejeon 305-811, Republic of Korea
2Département de Mathématiques, Université d'Evry Val d'Essonne, France
3Woosuk University, Samlae, Wanju, Jeonbuk 565-701, Republic of Korea

Received 30 May 2014; Accepted 29 July 2014; Published 27 August 2014

Academic Editor: Elena Litsyn

Copyright © 2014 Daeyeoul Kim et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

We study combinatoric convolution sums of certain divisor functions involving even indices. We express them as a linear combination of divisor functions and Euler polynomials and obtain identities , , and . As applications of these identities, we give several concrete interpretations in terms of the procedural modelling method.

1. Statement of Main Theoretical Results

Bernoulli polynomials and Euler polynomials are usually defined by means of the following generating functions: and .

Bernoulli numbers and Euler numbers are and . We recall the fundamental properties as follows [1, 2]: For and , we define the following: We are motivated by the Besge [3] and Ramanujan [4] identity and also by the recent development on the convolution sums. In this paper, we investigate the three combinatoric convolution sums with “even indices.” Consider where with . Now, we state our main results.

Theorem 1. For any positive integers   and , one has

Corollary 2. Let be integer and and primes with . Then one has

Theorem 3. For any positive integers   and , one has

Theorem 3 can be obtained by [5, 6]. Therefore, we omit the proof.

2. Application and Perspective

2.1. Branch and Leaves Pattern

In real-time virtual system, realistic and efficient generation and expression of plants composing a broad terrain is a continuing problem [7, 8]. The procedural modelling method using convolution sums of divisor functions (MCD) was suggested for a variety of natural trees in a virtual ecosystem [9]. The basic structure of MCD is that it defines the growth grammar including the branch propagation, a growth pattern of branches and leaves, and a process of growth deformation for various generations of tree. In Figure 1, we illustrate the MCD for the divisor trees.

289187.fig.001
Figure 1: MCD tree.

For more examples see [10]. Theorems 1 and 3 give us basic background for efficient and diverse generations and expressions of trees composing virtual ecosystem or real-time animation processing. In order to apply MCD to the growth structure of a tree model, (5) is modified and expressed in where represents various divisor functions, is the current growth step (), and is the final iteration number of the th growth step. Here, is a divisor function that determines the pattern of the number of branches and is a divisor function that determines the number of leaves with different types of trees and grasses in the virtual system. Further, are the th exponential function of branches and leaves. Through this model, we verified the possibility of natural and efficient tree growth [9, 11]. We approximately fix a certain tree model for MCD satisfying the patterns of branch and leaves in virtual system or real tree wood; then using formulae (8), (9), and (10), we obtain the approximate total number for MCD trees leaves by taking two kinds of trees with approximate MCD (Theorem 3), that is, branch pattern (resp., ) and leaves pattern (resp., ). We give the first eleven values of the approximate total number for MCD tree leaves with steps (see Table 1).

tab1
Table 1

2.2. Color of Leaves

Leaves are important elements that constitute plants [12]. In [13] we see the leaves model of convolution sum of divisor functions. First, we fix the random color variation step and then we compute convolution sums by use of (6) as shown in Figure 2. We denote by the start and destination colors; output colors in phase are determined by interpolating convolution sums. Next, based on the minimum and maximum values of the elements of convolution sums of divisor functions, normalized weighted values between 0 and 1 are calculated and then each color table is organized as follows: The noise map that utilizes Perlin noise is used in the creation of cloud textures for soft color changes. Here, is the number of values that are not duplicated among the elements of convolution sums calculated in the selected table; , are the maximum and minimum noise values; and indicates the section of noise values influenced by a single element of convolution sums. Once these parameters are fixed, the leaf color is determined by finding the index “” and the corresponding color “” in the color table comprised of divisor functions that correspond to the noise color in th row and th column [13]. Figure 2 represents the image of a color table set created by calculating the color table of each section. Theorem 1 gives the number of values of leaf color and Theorem 3 gives pattern of branch and leaves in the same model. In real-time ecosystem, efficient and fast time is requested. When is large, the MCD that uses (7) is complicate to compute directly in reasonable time. Our results (8), (9), and (10) give simple formulas for efficient time for them. In the forthcoming papers, we will investigate more applications of real-time virtual ecosystem.

289187.fig.002
Figure 2: Color of leaves.
2.3. Proof of Main Results

To prove Theorem 1, we establish Lemmas 4, 6, 7, and 9 and Corollary 5 and we recall Proposition 8.

Lemma 4. Let . Set . Then one has

Proof. By formula (4) we obtain By (15) and (1) we get the lemma.

By [14, Theorem 3] and Lemma 4 we get the corollary.

Corollary 5. Let and . Then

Lemma 6. For any integers   and , one has

Proof. Write the series as follows: This completes the proof of (17). On the other hand, (18) may be rewritten as From (17) we obtain This completes the proof of the lemma.

Lemma 7. For any integers   and , one has

Proof. We observe that From (18), we get We then get lemma.

We recall Proposition 8 to be modified in Lemma 9.

Proposition 8 (see [15]). Let , , and . One has where .

Using Lemma 7, we modify Proposition 8 as follows.

Lemma 9. For any one has

Proof. First, we check that From Lemma 7 and Proposition 8, our claim follows.

To end the proof of Theorem 1, we observe that Comparing Corollary 5 and Lemma 9, we see that From (3) we have By (2) and (3) we get the theorem.

Proof of Corollary 2. From ([16, page 150]) we can derive We set and in (31) and get the corollary.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

References

  1. A. Erdelyi, Higher Transcendental Functions, vol. 1, McGraw Hill, New York, NY, USA, 1953.
  2. H. M. Srivastava and A. Pinter, “Remarks on some relationships between the Bernoulli and Euler polynomials,” Applied Mathematics Letters, vol. 17, no. 4, pp. 375–380, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. M. Besge, “Extrait d'une lettre de M. Besge à M. Liouville,” Journal de Mathématiques Pures et Appliquées, vol. 7, p. 256, 1862.
  4. S. Ramanujan, “On certain arithmetical functions,” Transactions of the Cambridge Philosophical Society, vol. 22, pp. 159–184, 1916.
  5. B. Cho, D. Kim, and H. Park, “Evaluation of a certain combinatorial convolution sum in higher level cases,” Journal of Mathematical Analysis and Applications, vol. 406, no. 1, pp. 203–210, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. D. Kim and A. Bayad, “Convolution identities for twisted Eisenstein series and twisted divisor functions,” Fixed Point Theory and Applications, vol. 2013, article 81, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  7. W. Palubicki, K. Horel, S. Longay et al., “Self-organizing tree models for image synthesis,” ACM Transactions on Graphics, vol. 28, no. 3, article 58, 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. P. Tan, T. Fang, J. Xiao, P. Zhao, and L. Quan, “Single image tree modeling,” ACM Transactions on Graphics, vol. 27, no. 5, article 108, 2008. View at Publisher · View at Google Scholar · View at Scopus
  9. J. Kim, D. Kim, and H. Cho, “Procedural modeling of trees based on convolution sums of divisor functions for real-time virtual ecosystems,” Computer Animation and Virtual Worlds, vol. 24, no. 3-4, pp. 237–246, 2013. View at Publisher · View at Google Scholar · View at Scopus
  10. http://open.nims.re.kr/JrDr/.
  11. J. Kim, D. Kim, and H. Cho, “Tree growth model design for realistic game landscape production (Korean),” Journal of Korea Game Society, vol. 13, no. 2, pp. 49–58, 2013.
  12. H. Xiao and X. Chen, “Modeling and simulation of curled dry leaves,” Soft Matter, vol. 7, no. 22, pp. 10794–10802, 2011. View at Publisher · View at Google Scholar · View at Scopus
  13. J. Kim and D. Kim, “The procedural modeling and visualization of multiple leaves,” Submitted.
  14. D. Kim and Y. K. Park, “Bernoulli identities and combinatoric convolution sums with odd divisor functions,” Abstract and Applied Analysis, vol. 2014, Article ID 890973, 8 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  15. B. Cho, D. Kim, and H. Park, “Certain combinatorial convolu tion sums for divisor functions and Bernoulli numbers,” accepted to Bulletin of the Korean Mathematical Society.
  16. W. Chu and R. R. Zhou, “Convolution of Bernoulli and Euler polynomials,” Sarajevo Journal of Mathematics, vol. 6, no. 18, pp. 147–163, 2010. View at MathSciNet