Analytic Combinatorics
Analytic Combinatorics

Author: Philippe Flajolet

Publisher: Cambridge University Press

Published: 2009-01-15

Total Pages: 825

ISBN-13: 1139477161

DOWNLOAD EBOOK

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.

The Rise and Development of the Theory of Series up to the Early 1820s
The Rise and Development of the Theory of Series up to the Early 1820s

Author: Giovanni Ferraro

Publisher: Springer Science & Business Media

Published: 2007-12-20

Total Pages: 392

ISBN-13: 0387734686

DOWNLOAD EBOOK

The manuscript gives a coherent and detailed account of the theory of series in the eighteenth and early nineteenth centuries. It provides in one place an account of many results that are generally to be found - if at all - scattered throughout the historical and textbook literature. It presents the subject from the viewpoint of the mathematicians of the period, and is careful to distinguish earlier conceptions from ones that prevail today.

Neutron Fluctuations
Neutron Fluctuations

Author: Imre Pazsit

Publisher: Elsevier

Published: 2007-10-05

Total Pages: 359

ISBN-13: 0080550436

DOWNLOAD EBOOK

The transport of neutrons in a multiplying system is an area of branching processes with a clear formalism. Neutron Fluctuations presents an account of the mathematical tools used in describing branching processes, which are then used to derive a large number of properties of the neutron distribution in multiplying systems with or without an external source. In the second part of the book, the theory is applied to the description of the neutron fluctuations in nuclear reactor cores as well as in small samples of fissile material. The question of how to extract information about the system under study is discussed. In particular the measurement of the reactivity of subcritical cores, driven with various Poisson and non-Poisson (pulsed) sources, and the identification of fissile material samples, is illustrated. The book gives pragmatic information for those planning and executing and evaluating experiments on such systems. - Gives a complete treatise of the mathematics of branching particle processes, and in particular neutron fluctuations, in a self-contained manner - The first monograph containing the theory and application of neutron fluctuations in low power ADS (spallation and pulsed sources) - Suitable as a tutorial and handbook/reference book for scientists and graduate students - One of the authors is the founder of the mathematical theory of neutron fluctuations in zero power systems

Discrete Mathematics
Discrete Mathematics

Author: Oscar Levin

Publisher: Createspace Independent Publishing Platform

Published: 2016-08-16

Total Pages: 342

ISBN-13: 9781534970748

DOWNLOAD EBOOK

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.

Introduction to Arithmetical Functions
Introduction to Arithmetical Functions

Author: Paul J. McCarthy

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 373

ISBN-13: 1461386209

DOWNLOAD EBOOK

The theory of arithmetical functions has always been one of the more active parts of the theory of numbers. The large number of papers in the bibliography, most of which were written in the last forty years, attests to its popularity. Most textbooks on the theory of numbers contain some information on arithmetical functions, usually results which are classical. My purpose is to carry the reader beyond the point at which the textbooks abandon the subject. In each chapter there are some results which can be described as contemporary, and in some chapters this is true of almost all the material. This is an introduction to the subject, not a treatise. It should not be expected that it covers every topic in the theory of arithmetical functions. The bibliography is a list of papers related to the topics that are covered, and it is at least a good approximation to a complete list within the limits I have set for myself. In the case of some of the topics omitted from or slighted in the book, I cite expository papers on those topics.

Obtaining Generating Functions
Obtaining Generating Functions

Author: Elna B. McBride

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 109

ISBN-13: 364287682X

DOWNLOAD EBOOK

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

Published: 2014-05-10

Total Pages: 193

ISBN-13: 1483276635

DOWNLOAD EBOOK

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.