Obtaining Generating Functions

Obtaining Generating Functions
Author: Elna B. McBride
Publisher: Springer Science & Business Media
Total Pages: 109
Release: 2012-12-06
Genre: Science
ISBN: 364287682X

This book is an introduction to the study of methods of obtaining generating functions. It is an expository work at the level of the beginning graduate student. The first part of Chapter I gives the reader the necessary definitions and basic concepts. The fundamental method of direct summation is explained and illustrated. The second part of Chapter I deals with the methods developed by Rainville. These methods are based principally on inventive manipulation of power series. Weisner's group-theoretic method is explained in detail in Chapter II and is further illustrated in Chapter III. When this method is applicable, it yields a set of at least three generating functions. In Chapter II for the Laguerre polynomials six generating functions were found. Truesdell's method is studied in Chapter IV. For a given set of functions {fez, an the success of this method depends on the existence of certain transformations. If fez, a) can be transformed into F(z, a) such that a a-; F(z, a)=F(z, a+ 1), or if fez, a) can be transformed into G(z, a) such that a a-; G(z, a)=G(z, a-I), then from each transformed function a generating function can be obtained. Truesdell's method for obtaining the transformed functions does not require any ingenuity on the user's part. Truesdell has shown how these simple results may be exploited to generate more complicated results by means of specified, systematic, and general processes. His method of obtaining generating functions is only one of these results.

Generatingfunctionology

Generatingfunctionology
Author: Herbert S. Wilf
Publisher: Elsevier
Total Pages: 193
Release: 2014-05-10
Genre: Mathematics
ISBN: 1483276635

Generatingfunctionology provides information pertinent to generating functions and some of their uses in discrete mathematics. This book presents the power of the method by giving a number of examples of problems that can be profitably thought about from the point of view of generating functions. Organized into five chapters, this book begins with an overview of the basic concepts of a generating function. This text then discusses the different kinds of series that are widely used as generating functions. Other chapters explain how to make much more precise estimates of the sizes of the coefficients of power series based on the analyticity of the function that is represented by the series. This book discusses as well the applications of the theory of generating functions to counting problems. The final chapter deals with the formal aspects of the theory of generating functions. This book is a valuable resource for mathematicians and students.

Discrete Mathematics

Discrete Mathematics
Author: Oscar Levin
Publisher: Createspace Independent Publishing Platform
Total Pages: 342
Release: 2016-08-16
Genre:
ISBN: 9781534970748

This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proof" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this. Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs. The book contains over 360 exercises, including 230 with solutions and 130 more involved problems suitable for homework. There are also Investigate! activities throughout the text to support active, inquiry based learning. While there are many fine discrete math textbooks available, this text has the following advantages: It is written to be used in an inquiry rich course. It is written to be used in a course for future math teachers. It is open source, with low cost print editions and free electronic editions.

Analytic Combinatorics

Analytic Combinatorics
Author: Philippe Flajolet
Publisher: Cambridge University Press
Total Pages: 825
Release: 2009-01-15
Genre: Mathematics
ISBN: 1139477161

Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.

Applied Discrete Structures

Applied Discrete Structures
Author: Ken Levasseur
Publisher: Lulu.com
Total Pages: 574
Release: 2012-02-25
Genre: Computers
ISBN: 1105559297

''In writing this book, care was taken to use language and examples that gradually wean students from a simpleminded mechanical approach and move them toward mathematical maturity. We also recognize that many students who hesitate to ask for help from an instructor need a readable text, and we have tried to anticipate the questions that go unasked. The wide range of examples in the text are meant to augment the "favorite examples" that most instructors have for teaching the topcs in discrete mathematics. To provide diagnostic help and encouragement, we have included solutions and/or hints to the odd-numbered exercises. These solutions include detailed answers whenever warranted and complete proofs, not just terse outlines of proofs. Our use of standard terminology and notation makes Applied Discrete Structures a valuable reference book for future courses. Although many advanced books have a short review of elementary topics, they cannot be complete. The text is divided into lecture-length sections, facilitating the organization of an instructor's presentation.Topics are presented in such a way that students' understanding can be monitored through thought-provoking exercises. The exercises require an understanding of the topics and how they are interrelated, not just a familiarity with the key words. An Instructor's Guide is available to any instructor who uses the text. It includes: Chapter-by-chapter comments on subtopics that emphasize the pitfalls to avoid; Suggested coverage times; Detailed solutions to most even-numbered exercises; Sample quizzes, exams, and final exams. This textbook has been used in classes at Casper College (WY), Grinnell College (IA), Luzurne Community College (PA), University of the Puget Sound (WA).''--

Recurrent Sequences

Recurrent Sequences
Author: Dorin Andrica
Publisher: Springer Nature
Total Pages: 410
Release: 2020-09-23
Genre: Mathematics
ISBN: 3030515028

This self-contained text presents state-of-the-art results on recurrent sequences and their applications in algebra, number theory, geometry of the complex plane and discrete mathematics. It is designed to appeal to a wide readership, ranging from scholars and academics, to undergraduate students, or advanced high school and college students training for competitions. The content of the book is very recent, and focuses on areas where significant research is currently taking place. Among the new approaches promoted in this book, the authors highlight the visualization of some recurrences in the complex plane, the concurrent use of algebraic, arithmetic, and trigonometric perspectives on classical number sequences, and links to many applications. It contains techniques which are fundamental in other areas of math and encourages further research on the topic. The introductory chapters only require good understanding of college algebra, complex numbers, analysis and basic combinatorics. For Chapters 3, 4 and 6 the prerequisites include number theory, linear algebra and complex analysis. The first part of the book presents key theoretical elements required for a good understanding of the topic. The exposition moves on to to fundamental results and key examples of recurrences and their properties. The geometry of linear recurrences in the complex plane is presented in detail through numerous diagrams, which lead to often unexpected connections to combinatorics, number theory, integer sequences, and random number generation. The second part of the book presents a collection of 123 problems with full solutions, illustrating the wide range of topics where recurrent sequences can be found. This material is ideal for consolidating the theoretical knowledge and for preparing students for Olympiads.

Analytic Combinatorics in Several Variables

Analytic Combinatorics in Several Variables
Author: Robin Pemantle
Publisher: Cambridge University Press
Total Pages: 395
Release: 2013-05-31
Genre: Mathematics
ISBN: 1107031575

Aimed at graduate students and researchers in enumerative combinatorics, this book is the first to treat the analytic aspects of combinatorial enumeration from a multivariate perspective.

Frontiers In Orthogonal Polynomials And Q-series

Frontiers In Orthogonal Polynomials And Q-series
Author: M Zuhair Nashed
Publisher: World Scientific
Total Pages: 577
Release: 2018-01-12
Genre: Mathematics
ISBN: 981322889X

This volume aims to highlight trends and important directions of research in orthogonal polynomials, q-series, and related topics in number theory, combinatorics, approximation theory, mathematical physics, and computational and applied harmonic analysis. This collection is based on the invited lectures by well-known contributors from the International Conference on Orthogonal Polynomials and q-Series, that was held at the University of Central Florida in Orlando, on May 10-12, 2015. The conference was dedicated to Professor Mourad Ismail on his 70th birthday.The editors strived for a volume that would inspire young researchers and provide a wealth of information in an engaging format. Theoretical, combinatorial and computational/algorithmic aspects are considered, and each chapter contains many references on its topic, when appropriate.

Abel’s Theorem in Problems and Solutions

Abel’s Theorem in Problems and Solutions
Author: V.B. Alekseev
Publisher: Springer Science & Business Media
Total Pages: 278
Release: 2007-05-08
Genre: Mathematics
ISBN: 1402021879

Do formulas exist for the solution to algebraical equations in one variable of any degree like the formulas for quadratic equations? The main aim of this book is to give new geometrical proof of Abel's theorem, as proposed by Professor V.I. Arnold. The theorem states that for general algebraical equations of a degree higher than 4, there are no formulas representing roots of these equations in terms of coefficients with only arithmetic operations and radicals. A secondary, and more important aim of this book, is to acquaint the reader with two very important branches of modern mathematics: group theory and theory of functions of a complex variable. This book also has the added bonus of an extensive appendix devoted to the differential Galois theory, written by Professor A.G. Khovanskii. As this text has been written assuming no specialist prior knowledge and is composed of definitions, examples, problems and solutions, it is suitable for self-study or teaching students of mathematics, from high school to graduate.

Inquiry-Based Enumerative Combinatorics

Inquiry-Based Enumerative Combinatorics
Author: T. Kyle Petersen
Publisher: Springer
Total Pages: 244
Release: 2019-06-28
Genre: Mathematics
ISBN: 3030183084

This textbook offers the opportunity to create a uniquely engaging combinatorics classroom by embracing Inquiry-Based Learning (IBL) techniques. Readers are provided with a carefully chosen progression of theorems to prove and problems to actively solve. Students will feel a sense of accomplishment as their collective inquiry traces a path from the basics to important generating function techniques. Beginning with an exploration of permutations and combinations that culminates in the Binomial Theorem, the text goes on to guide the study of ordinary and exponential generating functions. These tools underpin the in-depth study of Eulerian, Catalan, and Narayana numbers that follows, and a selection of advanced topics that includes applications to probability and number theory. Throughout, the theory unfolds via over 150 carefully selected problems for students to solve, many of which connect to state-of-the-art research. Inquiry-Based Enumerative Combinatorics is ideal for lower-division undergraduate students majoring in math or computer science, as there are no formal mathematics prerequisites. Because it includes many connections to recent research, students of any level who are interested in combinatorics will also find this a valuable resource.