Combinatorial Methods in Discrete Distributions

Commencing with an introductory chapter on combinatorial, finite differences and probabilistic fundamental background, this book provides a self-contained reference for the area.

This volume provides the necessary combinatorial methods in the theory of discrete distributions, including basic enumerative techniques, finite differences, Stirling numbers and partition polynomials.

Key features include: Numerous worked examples; Provides a rich collection of exercises of varying difficulty, which help to consolidate the concepts and results being presented, while others complement, extend or generalize some of the results; An extensive bibliography refers readers to multiple sources of interest; Reference notes are included at the end of each chapter to inform on the original contribution.