00:00:00 / 00:00:00

Lattice paths with flexible boundaries: patterns, automata, and counting

By Sarah Selkirk

Appears in collection : Enumerative combinatorics and effective aspects of differential equations Thematic Month Week 5 / Combinatoire énumérative et aspects effectifs des équations différentielles Mois thématique semaine 5

Lattice paths are fundamental combinatorial objects, and their enumeration has strong connections to other fields (physics, computer science). In this talk, we will review enumeration of models of lattice paths with forbidden patterns and with dynamic boundary in both one- and two-dimensional models. We will also examine how automata-based approaches often result in the simplification and classification of enumeration problems.

Information about the video

Citation data

  • DOI 10.24350/CIRM.V.20315803
  • Cite this video Selkirk, Sarah (27/02/2025). Lattice paths with flexible boundaries: patterns, automata, and counting. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.20315803
  • URL https://dx.doi.org/10.24350/CIRM.V.20315803

Domain(s)

Document(s)

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback