Lattice Path Combinatorics and Special Counting Sequences

Regular price €81.99
Quantity:
Ships in 10-20 days
Delivery/Collection within 10-20 working days
Shipping & Delivery
A01=Chunwei Song
advanced discrete structures
Age Group_Uncategorized
Age Group_Uncategorized
Author_Chunwei Song
automatic-update
bijective proofs
Category1=Non-Fiction
Category=PBD
Category=PBF
Category=PBV
combinatorial sequence analysis
Combinatorial Statistics
Contemporary Combinatorics
COP=United Kingdom
Delivery_Pre-order
Discrete Math
enumerative combinatorics
eq_isMigrated=2
eq_nobargain
graduate combinatorics course
Language_English
Lattice Path Combinatorics
PA=Not yet available
Price_€50 to €100
PS=Forthcoming
softlaunch
symmetric functions
tableau theory

Product details

  • ISBN 9781032671758
  • Weight: 453g
  • Dimensions: 178 x 254mm
  • Publication Date: 17 Sep 2024
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Hardback
  • Language: English
Secure checkout Fast Shipping Easy returns

This book endeavors to deepen our understanding of lattice path combinatorics, explore key types of special sequences, elucidate their interconnections, and concurrently champion the author's interpretation of the “combinatorial spirit”.

The author intends to give an up-to-date introduction to the theory of lattice path combinatorics, its relation to those special counting sequences important in modern combinatorial studies, such as the Catalan, Schröder, Motzkin, Delannoy numbers, and their generalized versions. Brief discussions of applications of lattice path combinatorics to symmetric functions and connections to the theory of tableaux are also included. Meanwhile, the author also presents an interpretation of the "combinatorial spirit" (i.e., "counting without counting", bijective proofs, and understanding combinatorics from combinatorial structures internally, and more), hoping to shape the development of contemporary combinatorics.

Lattice Path Combinatorics and Special Counting Sequences: From an Enumerative Perspective will appeal to graduate students and advanced undergraduates studying combinatorics, discrete mathematics, or computer science.

Chunwei Song, a combinatorialist and graph theorist, is a professor of mathematics at Peking University. He received his PhD from the University of Pennsylvania in 2004. He also held faculty positions at Boston College, MA and the Tokyo Institute of Technology, Japan. In 2010, he was a visiting associate professor at the University of Delaware. At Peking University, six students have received PhD degrees under his supervision, specializing in the fields of lattice path combinatorics, extremal combinatorics, or mathematical philosophy.

More from this author