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.