Dissertation > Excellent graduate degree dissertation topics show

Applications of the Generating Function Method in Combinatorial Identities

Author: YangWeiWei
Tutor: ZhaoXiQiang
School: Ocean University of China
Course: Operational Research and Cybernetics
Keywords: Generating function Stirling numbers of first kind Stirling numbers of second kind Bernoulli number Bellnumber
CLC: O157
Type: Master's thesis
Year: 2010
Downloads: 78
Quote: 0
Read: Download Dissertation

Abstract


It is one of important methods in combinatorics to prove identities and solve recurrence relations by using generating function. In this paper, generating function is used to study recurrence relations and identities on Stirling numbers, Bernoulli numbers and Bell numbers. The main results of the thesis can be summarized as follows:1. Firstly generating function’s properties of unsigned Stirling numbers of first kind and the central factorial numbers are discussed. Secondly generating function is applied to the research of boundary value problems and three term boundary value problems is generalized toκ-term boundary value problems. Lastly, two examples are given to illustrate the obtained method.2. The Stirling numbers of second kind are applied to the research of the generalized central factorial numbers’congruence relations.3. The Bernoulli numbers and the Stirling numbers of two kinds are used as bridge to link two series and discuss the generating functions of the two series.

Related Dissertations

  1. The Model of Control and Model Calculations,O211.3
  2. Class of sequences of multiple convolution formula,O157.1
  3. Research on a Generating Function Associating with Record Time,O211.3
  4. The Research about the Moments of a Kind of Special Discrete Distribution,O211.3
  5. Some Discussions about Record Value Indicators,O211.6
  6. A Factorized Banded Inverse Preconditioner for Toeplitz Matrices,O151.21
  7. Riordan Array Method to Combinatorial Identities,O157
  8. On the M~ξ /M~r /m Multi-servers Queue with Bulk Arrival and Bulk Service,O226
  9. Generalization of Poisson Process and Applications,O211.6
  10. Some Studies of the Measure-valued Branching Processes,O211.62
  11. The Webpage Auto Generating Tools under the PHP Technology,TP393.092
  12. Asymptotic Enumeration Methods of Combinatorics,O157
  13. Impatient degree of system status the M/M/1 vacation queuing system,O226
  14. M/M/1 with balking, reneging and multiple working vacation queuing system,O226
  15. Strong Limit Theorems for Mixing Sequences,O211.4
  16. End to End Performance Mearsurement of Network Delay,TN915.06
  17. Nonlinearization of a Kind of Eigenvalue Problem,O175
  18. The Moment Generating Function and Multifractal Analysis for Occupation Measure of Additive Brownian Motion,O211.6
  19. The nature of the random allocation rule Drop-the-loser supplement,O213
  20. On the Performance of Space-Time Coding over Fading Channels in Non-Gaussian Noise,TN911.2

CLC: > Mathematical sciences and chemical > Mathematics > Algebra,number theory, portfolio theory > Combinatorics ( combinatorics )
© 2012 www.DissertationTopic.Net  Mobile