Dr. Catherine Yan will be=
presenting on the Lemma of Lindstrom-Gessel-Viennot and its applications i=
n combinatorics.
The Lemma of Lin=
dstrom-Gessel-Viennot is one of the most elegant=20
theorems in Enumerative Combinatorics, which reveals via involutions an=20
astounding connection between lattice paths and determinants. It was=20
originally proved by Lindstrom in 1973, but its combinatorial=20
significance was seen first and expounded by Gessel and Viennot.=C2=A0
I=
n=20
this talk, we will start with the idea of involution/reflection in=20
combinatorial problems, introduce this lemma, and show various=20
applications in matrix identity, lattice path counting, and plane=20
partitions
<=
/span>
You can join =
us March 29th at 7:30pm using the link below:
Meeting ID: 944 5838 6705
Passcode: MathClub21
Thanks, and we hope to see you there!
Jonathan Aberle<=
/span>
Pi Mu Epsilon=
President