Analytic Combinatorics is a self-contained treatment of the mathematics underlying the analysis of discrete structures, which has emerged over the past several decades as an essential tool in the understanding of properties of computer programs and scientific models with applications in physics, biology and chemistry. Thorough treatment of a large number of classical applications is an essential aspect of the presentation. Written by the leaders in the field of analytic combinatorics, this text is certain to become the definitive reference on the topic. The text is complemented with exercises, examples, appendices and notes to aid understanding therefore, it can be used as the basis for an advanced undergraduate or a graduate course on the subject, or for self-study.

Analytic Combinatorics

Preliminaries.- Bell polynomials, composite structures and Gibbs partitions.- Exchangeable random partitions.- Sequential constructions of random partitions.- Poisson constructions of random partitions.- Coagulation and fragmentation processes.- Random walks and random forests.- The Brownian forest.- Brownian local times, branching and Bessel processes.- Brownian bridge asymptotics for random mappings.- Random forests and the additive coalescent.

/pdf/combinatorial-stochastic-processes-4nf5lxpd0t.pdf

Combinatorial Stochastic Processes

In One Line and Close. Permutations as Linear Orders. Descents Alternating Runs Alternating Subsequences In One Line and Anywhere. Permutations as Linear Orders. Inversions. Inversions Inversion in Permutations of Multisets In Many Circles. Permutations as Products of Cycles. Decomposing a Permutation into Cycles Type and Stirling Numbers Cycle Decomposition versus Linear Order Permutations with Restricted Cycle Structure In Any Way but This. Pattern Avoidance. The Basics. The Notion of Pattern Avoidance Patterns of Length Three Monotone Patterns Patterns of Length Four The Proof of the Stanley-Wilf Conjecture In This Way but Nicely. Pattern Avoidance. Follow-Up. Polynomial Recurrences Containing a Pattern Many Times Containing a Pattern a Given Number of Times Mean and Insensitive. Random Permutations. The Probabilistic Viewpoint Expectation Variance and Standard Deviation An Application: Longest Increasing Subsequences Permutations versus Everything Else. Algebraic Combinatorics of Permutations. The Robinson-Schensted-Knuth Correspondence Posets of Permutations Simplicial Complexes of Permutations Get Them All. Algorithms and Permutations. Generating Permutations Stack Sorting Permutations Variations of Stack Sorting How Did We Get Here? Permutations as Genome Rearrangements. Introduction Block Transpositions Block Interchanges Block Transpositions Revisited Solutions to Odd-Numbered Exercises References List of Frequently Used Notation Index Exercises, Problems, and Problem Solutions appear at the end of each chapter.

Combinatorics of Permutations

Une théorie combinatoire des séries formelles

The elements of many classical combinatorial structures can be naturally decomposed into components Permutations can be decomposed into cycles, polynomials over a finite field into irreducible factors, mappings into connected components In all of these examples, and in many more, there are strong similarities between the numbers of components of different sizes that are found in the decompositions of `typical' elements of large size For instance, the total number of components grows logarithmically with the size of the element, and the size of the largest component is an appreciable fraction of the whole This book explains the similarities in asymptotic behaviour as the result of two basic properties shared by the structures: the conditioning relation and the logarithmic condition The discussion is conducted in the language of probability, enabling the theory to be developed under rather general and explicit conditions; for the finer conclusions, Stein's method emerges as the key ingredient The book is thus of particular interest to graduate students and researchers in both combinatorics and probability theory

Logarithmic Combinatorial Structures: A Probabilistic Approach

The combinatorial theory of species, introduced by Joyal in 1980, provides a unified understanding of the use of generating functions for both labelled and unlabelled structures and as a tool for the specification and analysis of these structures. Of particular importance is their capacity to transform recursive definitions of tree-like structures into functional or differential equations, and vice versa. The goal of this book is to present the basic elements of the theory and to give a unified account of its developments and applications. It offers a modern introduction to the use of various generating functions, with applications to graphical enumeration, Polya theory and analysis of data structures in computer science, and to other areas such as special functions, functional equations, asymptotic analysis and differential equations. This book will be a valuable reference to graduate students and researchers in combinatorics, analysis, and theoretical computer science.

Combinatorial species and tree-like structures

The different results proved in this paper do not have very much in common. Since they all deal with the location of the zeros of a polynomial, we have decided to put them in one place. Improving upon a classical result of Cauchy we obtain in § 2 a circle containing all the zeros of a polynomial. In § 3 we obtain an extension of the well known theorem of Enestrőm and Kakeya concerning the zeros of a polynomial whose coefficients are non-negative and monotonie.

On the Location of Zeros of Polynomials

Une nouvelle démonstration combinatoire des formules d'inversion de Lagrange

Several characteristic parameters of randomly grown quadtrees of any dimension are analyzed. Additive parameters have expectations whose generating functions are expressible in terms of generalized hypergeometric functions. A complex asymptotic process based on singularity analysis and integral representations akin to Mellin transforms leads to explicit values for various structure constants related to path length, retrieval costs, and storage occupation. © 1995 Wiley Periodicals, Inc.

/pdf/hypergeometrics-and-the-cost-structure-of-quadtrees-iqvldcqr8h.pdf

Gilbert Labelle

Papers

Combinatorial species and tree-like structures

On the Location of Zeros of Polynomials

Une nouvelle démonstration combinatoire des formules d'inversion de Lagrange

Hypergeometrics and the cost structure of quadtrees

Enumeration of m-Ary Cacti