Lattice Paths with Flexible Boundaries: Patterns, Automata, and Counting
Centre International de Rencontres Mathématiques via YouTube
Get 20% off all career paths from fullstack to AI
AI, Data Science & Cloud Certificates from Google, IBM & Meta
Overview
Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
Explore the fascinating world of lattice paths in this 49-minute conference talk by Sarah Selkirk, recorded during the "Enumerative combinatorics and effective aspects of differential equations" thematic meeting at the Centre International de Rencontres Mathématiques (CIRM) in Marseille, France. Discover the fundamental combinatorial nature of lattice paths and their important connections to physics and computer science. Learn about enumeration techniques for lattice path models with forbidden patterns and dynamic boundaries in both one- and two-dimensional contexts. Understand how automata-based approaches can simplify and classify complex enumeration problems. The talk provides valuable insights into mathematical patterns and counting techniques essential for researchers and students interested in combinatorial mathematics.
Syllabus
Sarah Selkirk: Lattice Paths with Flexible Boundaries: Patterns, Automata, and Counting
Taught by
Centre International de Rencontres Mathématiques