000			03753nam a2200421 i 4500
999			_c387668 _d387668
001			387668
003			ES-MaUEC
005			20230410133945.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2019 sz | o |||| 0|eng d
020			_a9783031794100
024	7		_a10.1007/978-3-031-79410-0 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA351 _b2019 EB
100	1		_aChattamvelli, Rajan _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686393
245	1	0	_aGenerating Functions in Engineering and the Applied Sciences _cby Rajan Chattamvelli, Ramalingam Shanmugam
250			_a1st edition 2019
264		1	_aCham _bSpringer International Publishing _c2019
300			_a1 recurso en línea (XV, 99 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aSynthesis Lectures on Engineering _x1939-523X
505	0		_aList of Tables -- Types of Generating Functions -- Operations on Generating Functions -- Generating Functions in Statistics -- Applications of Generating Functions -- Bibliography -- Authors' Biographies -- Index .
520			_aThis 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.
988			_aSynthesis Collection of Technology_2019
650		7	_2embne _9138454 _aFunciones (Matemáticas)
700	1		_aShanmugam, Ramalingam _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686394
776	0	8	_iPrinted edition: _z9783031794117
776	0	8	_iPrinted edition: _z9783031794094
776	0	8	_iPrinted edition: _z9783031794124
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-79410-0 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b04/2023 _dz _eb _zSI