Muutke küpsiste eelistusi

Riordan Group and Applications 2022 ed. [Kõva köide]

  • Formaat: Hardback, 362 pages, kõrgus x laius: 235x155 mm, kaal: 740 g, 6 Illustrations, color; 13 Illustrations, black and white; XXII, 362 p. 19 illus., 6 illus. in color., 1 Hardback
  • Sari: Springer Monographs in Mathematics
  • Ilmumisaeg: 29-Apr-2022
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030941507
  • ISBN-13: 9783030941505
Teised raamatud teemal:
  • Kõva köide
  • Hind: 122,82 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 144,49 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Hardback, 362 pages, kõrgus x laius: 235x155 mm, kaal: 740 g, 6 Illustrations, color; 13 Illustrations, black and white; XXII, 362 p. 19 illus., 6 illus. in color., 1 Hardback
  • Sari: Springer Monographs in Mathematics
  • Ilmumisaeg: 29-Apr-2022
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030941507
  • ISBN-13: 9783030941505
Teised raamatud teemal:
The ever-growing applications and richness of approaches to the Riordan group is captured in this comprehensive monograph, authored by those who are among the founders and foremost world experts in this field.  The concept of a Riordan array has played a unifying role in enumerative combinatorics over the last three decades. The Riordan arrays and Riordan group is a new growth point in mathematics that is both being influenced by, and continuing its contributions to, other fields such as Lie groups, elliptic curves, orthogonal polynomials, spline functions, networks, sequences and series, Beal conjecture, Riemann hypothesis, to name several. In recent years the Riordan group has made links to quantum field theory and has become a useful tool for computer science and computational chemistry. We can look forward to discovering further applications to unexpected areas of research. Providing a baseline and springboard to further developments and study, this book may also serve as a text for anyone interested in discrete mathematics, including combinatorics, number theory, matrix theory, graph theory, and algebra.

Arvustused

Each chapter ends with a set of exercises, designed to help the reader to develop a deeper understanding of the theory and methods of Riordan arrays, and a reference section. Solutions to selected exercises are also provided at the end of the book. It is a pleasure to read such a comprehensive and clearly written book on Riordan arrays and the Riordan group. This book excellently introduces and develops a fascinating new research area of enumerative combiatronics. (Chen Sheng, zbMATH 1498.05002, 2022)

1 Introduction
1(18)
1.1 What are Riordan Arrays?
1(2)
1.2 Origins and Motivation
3(6)
1.3 Elementary Applications
9(10)
Exercises
16(1)
References
17(2)
2 Extraction of Coefficients and Generating Functions
19(28)
2.1 Formal Power Series
19(2)
2.2 Coefficient Extraction
21(3)
2.3 Lagrange Inversion Theorem
24(3)
2.4 Generating Functions
27(20)
Exercises
43(3)
References
46(1)
3 The Riordan Group
47(22)
3.1 Riordan Arrays and the Riordan Group
47(11)
3.2 Some Special Subgroups
58(4)
3.3 Several Aspects of the Riordan Group
62(7)
Exercises
66(1)
References
66(3)
4 Characterization of Riordan Arrays by Special Sequences
69(32)
4.1 The A- and Z- Sequences
70(7)
4.2 The A-matrix
77(13)
4.3 Is It a Riordan Array?
90(11)
Exercises
97(1)
References
98(3)
5 Combinatorial Sums and Inversions
101(22)
5.1 Combinatorial Sums
101(8)
5.2 Combinatorial Inversions
109(14)
Exercises
120(1)
References
121(2)
6 Generalized Riordan Arrays
123(90)
6.1 Exponential Riordan Arrays
124(6)
6.2 Generalized Riordan Arrays and the Riordan Group
130(8)
6.3 Relations Between Riordan Arrays and Sheffer Sequences
138(14)
6.4 Special Riordan Arrays and Sheffer Sequences
152(30)
6.5 Double Riordan Arrays and Sheffer Polynomial Pairs
182(31)
Exercises
205(4)
References
209(4)
7 Extensions of the Riordan Group
213(30)
7.1 Three-Dimensional Riordan Group
213(4)
7.2 Three-Dimensional Riordan Arrays
217(13)
7.3 The Riordan Group in Several Variables
230(13)
Exercises
238(2)
References
240(3)
8 Q-Analogs of Riordan Arrays
243(16)
8.1 Combinatorial q-Analogs
243(2)
8.2 Eulerian Generating Functions
245(1)
8.3 Q-Riordan Arrays
246(5)
8.4 Combinatorial Applications of the Q-Riordan Arrays
251(8)
Exercises
255(2)
References
257(2)
9 Orthogonal Polynomials
259(76)
9.1 Orthogonal Polynomials and Riordan Arrays
260(18)
9.2 Exponential Riordan Arrays and Classical Orthogonal Polynomials
278(7)
9.3 Orthogonal Polynomials as Moments
285(18)
9.4 Combinatorial Polynomials as Moments of Riordan Arrays
303(13)
9.5 Continued Fractions and Riordan Arrays
316(19)
Exercises
332(1)
References
333(2)
Solutions 335(24)
Index 359
Louis Shapiro is a Professor Emeritus at Howard University. He has taught at Howard for 56 years with research interests in enumerative combinatorics, finite groups, and of course the Riordan group. He is also an avid runner and square dance caller.





Renzo Sprugnoli is a mathematician and computer scientist working in the fields of analysis of algorithms and combinatorics. Of particular note his works on the computation of combinatorial sums and the enumeration of lattice paths through Riordan arrays and the special sequences arising in this context. As a full professor, he has taught classes on algorithms, data structures and databases at the University of Florence.





Paul Barry is Emeritus professor of mathematics at Waterford Institute of Technology, Ireland.  He carries out research into integer sequences and Riordan arrays. He is the author of the book Riordan Arrays: A Primer.





Gi-Sang Cheon is a mathematician working in the field of combinatorial matrix theory. He is a professor at the Department of Mathematics of Sungkyunkwan University in South Korea.











Tian-Xiao He is a professor of mathematics and the Earl and Marian A. Beling Professor of Natural Science at Illinois Wesleyan University. His research fields include enumerative combinatorics, Riordan group, numerical analysis, approximate theory, wavelet analysis, and number theory. 





Donatella Merlini is a computer scientist working in the fields of analysis of algorithms, enumerative combinatorics, symbolic computation and data mining, subjects she  teaches at the University of Florence. Since her PhD thesis, she has studied both the theoretical aspects of Riordan arrays and the applications in the context of algorithms and data structures analysis.







Weiping Wang is an associate professor of School of Science at ZhejiangSci-Tech University, China. His research fields include enumerative combinatorics, combinatorial algorithms, and special functions. His research topics are related to combinatorial sequences, combinatorial summations, and multiple zeta values.