Generating Functions in Engineering and the Applied Sciences

Chattamvelli, Rajan, Shanmugam, Ramalingam

  • 出版商: Morgan & Claypool
  • 出版日期: 2019-08-27
  • 售價: $2,300
  • 貴賓價: 9.5$2,185
  • 語言: 英文
  • 頁數: 111
  • 裝訂: Hardcover - also called cloth, retail trade, or trade
  • ISBN: 1681736403
  • ISBN-13: 9781681736402
  • 海外代購書籍(需單獨結帳)
    無現貨庫存(No stock available)


This is an introductory book on generating functions (GFs) and their applications.

It discusses commonly encountered generating functions in engineering and applied sciences, such as ordinary generating functions (OGF), exponential generating functions (EGF), probability generating functions (PGF), etc. Some new GFs like Pochhammer generating functions for both rising and falling factorials are introduced in Chapter 2. Two novel GFs called "mean deviation generating function" (MDGF) and "survival function generating function" (SFGF), are introduced in Chapter 3. The mean deviation of a variety of discrete distributions are derived using the MDGF. The last chapter discusses a large number of applications in various disciplines including algebra, analysis of algorithms, polymer chemistry, combinatorics, graph theory, number theory, reliability, epidemiology, bio-informatics, genetics, management, economics, and statistics.

Some background knowledge on GFs is often assumed for courses in analysis of algorithms, advanced data structures, digital signal processing (DSP), graph theory, etc. These are usually provided by either a course on "discrete mathematics" or "introduction to combinatorics." But, GFs are also used in automata theory, bio-informatics, differential equations, DSP, number theory, physical chemistry, reliability engineering, stochastic processes, and so on. Students of these courses may not have exposure to discrete mathematics or combinatorics. This book is written in such a way that even those who do not have prior knowledge can easily follow through the chapters, and apply the lessons learned in their respective disciplines. The purpose is to give a broad exposure to commonly used techniques of combinatorial mathematics, highlighting applications in a variety of disciplines.