Probability and Mathematical Statistics: A Series of Monographs and Textbooks: Lattice Path Counting and Applications focuses on the principles, methodologies, and approaches involved in lattice path counting and applications, including vector representation, random walks, and rank order statistics. The book first underscores the simple and general boundaries of path counting. Topics include types of diagonal steps and a correspondence, paths within general boundaries, higher dimensional paths, vector representation, compositions, and domination, recurrence and generating function method, and reflection principle. The text then examines invariance and fluctuation and random walk and rank order statistics. Discussions focus on random walks, rank order statistics, Chung-Feller theorems, and Sparre Andersen's equivalence. The manuscript takes a look at convolution identities and inverse relations and discrete distributions, queues, trees, and search codes, as well as discrete distributions and a correlated random walk, trees and search codes, convolution identities, and orthogonal relations and inversion formulas. The text is a valuable reference for mathematicians and researchers interested in in lattice path counting and applications.

The most recent methods in various branches of lattice path and enumerative combinatorics along with relevant applications are nicely grouped together and represented in this research contributed volume. Contributions to this edited volume will be mainly research articles however it will also include several captivating, expository articles (along with pictures) on the life and mathematical work of leading researchers in lattice path combinatorics and beyond. There will be four or five expository articles in memory of Shreeram Shankar Abhyankar and Philippe Flajolet and honoring George Andrews and Lajos Takács. There may be another brief article in memory of Professors Jagdish Narayan Srivastava and Joti Lal Jain. New research results include the kernel method developed by Flajolet and others for counting different classes of lattice paths continues to produce new results in counting lattice paths. The recent investigation of Fishburn numbers has led to interesting counting interpretations and a family of fascinating congruences. Formulas for new methods to obtain the number of Fq-rational points of Schubert varieties in Grassmannians continues to have research interest and will be presented here. Topics to be included are far reaching and will include lattice path enumeration, tilings, bijections between paths and other combinatoric structures, non-intersecting lattice paths, varieties, Young tableaux, partitions, enumerative combinatorics, discrete distributions, applications to queueing theory and other continuous time models, graph theory and applications. Many leading mathematicians who spoke at the conference from which this volume derives, are expected to send contributions including. This volume also presents the stimulating ideas of some exciting newcomers to the Lattice Path Combinatorics Conference series; “The 8th Conference on Lattice Path Combinatorics and Applications” provided opportunities for new collaborations; some of the products of these collaborations will also appear in this book. This book will have interest for researchers in lattice path combinatorics and enumerative combinatorics. This will include subsets of researchers in mathematics, statistics, operations research and computer science. The applications of the material covered in this edited volume extends beyond the primary audience to scholars interested queuing theory, graph theory, tiling, partitions, distributions, etc. An attractive bonus within our book is the collection of special articles describing the top recent researchers in this area of study and documenting the interesting history of who, when and how these beautiful combinatorial results were originally discovered.

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.

This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use to researchers in these domains. After a survey of current results and open problems on decidability in enumerative combinatorics, the text shows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables (ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory, applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, through examples and general theory, how results from stratified Morse theory can help refine some of these computability questions. Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text.

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.

This book is a gentle introduction to the enumerative part of combinatorics suitable for study at the advanced undergraduate or beginning graduate level. In addition to covering all the standard techniques for counting combinatorial objects, the text contains material from the research literature which has never before appeared in print, such as the use of quotient posets to study the Möbius function and characteristic polynomial of a partially ordered set, or the connection between quasisymmetric functions and pattern avoidance. The book assumes minimal background, and a first course in abstract algebra should suffice. The exposition is very reader friendly: keeping a moderate pace, using lots of examples, emphasizing recurring themes, and frankly expressing the delight the author takes in mathematics in general and combinatorics in particular.

Bijective proofs are some of the most elegant and powerful techniques in all of mathematics. Suitable for readers without prior background in algebra or combinatorics, Bijective Combinatorics presents a general introduction to enumerative and algebraic combinatorics that emphasizes bijective methods.The text systematically develops the mathematical