Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/autre/lattice-path-combinatorics-and-applications/descriptif_4130268
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=4130268

Lattice Path Combinatorics and Applications, 1st ed. 2019 Developments in Mathematics Series, Vol. 58

Langue : Anglais

Coordonnateurs : Andrews George E., Krattenthaler Christian, Krinik Alan

Couverture de l’ouvrage Lattice Path Combinatorics 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.

 

Preface.- Lajos Takács: A Tribute (A.M. Haghighi, S.G. Mohanty).- The Distribution of the Local Time of Brownian Motion with Drift (L. Takács).- Reflections on Shreeram Abhyankar (K. Alladi).- My Association and Collaboration with George Andrews (K. Alladi).- A Refinement of the Alladi–Schur Theorem (G.E. Andrews).- Explicit Formulas for Enumeration of Lattice Paths: Basketball and the Kernel Method (C. Banderier, C. Krattenthaler, A. Krinik, D. Kruchinin, V. Kruchinin, D. Nguyen, M. Wallner).- The Kernel Method for Lattice Paths below a Line of Rational Slope (C. Banderier, M. Wallner).- Enumeration of Colored Dyck Paths via Partial Bell Polynomials (D. Birmajer, J.B. Gil, P.R.W. McNamara, M.D. Weiner).- A Review of the Basic Discrete q-Distributions (Ch.A. Charalambides).- Families of Parking Functions Counted by the Schröder and Baxter Numbers (R. Cori, E. Duchi, S. Rinaldi, V. Guerrini).- Some Tilings, Colorings and Lattice Paths via Stern Polynomials (K. Dilcher, L. Ericksen).- p-Rook Numbers and Cycle Counting in Cp|Sn (J. Haglund, J. Remmel, M. Yoo).- Asymptotic Behaviour of Certain q-Poisson, q-Binomial and Negative q-Binomial Distributions (A. Kyriakoussis, M. Vamvakari).- Asymptotic Estimates for Queueing Systems with Time-Varying Periodic Transition Rates (B. Margolius).- A Combinatorial Analysis of the M/M[m]/1 Queue (G. Mercankosk, G.M. Nair).- Laws Relating Runs, Long Runs, and Steps in Gambler’s Ruin, with Persistence in Two Strata (G.J. Morrow).- Paired Patterns in Lattice Paths (R.Pan, J.B. Remmel).

Highlights applications of enumerative combinatorics to varieties, Young tableaux, partitions, queueing theory, tiling and graph theory

Presents recent methods in lattice path combinatorics

Discusses a wide breadth of topics and applications

Presents stimulating ideas of some of the exciting newcomers to the Lattice Path Combinatorics Conference series

Ces ouvrages sont susceptibles de vous intéresser