The Maseeh Mathematics and Statistics Colloquium Series* presents
~ Portland State University ~
LATTICE CHAINS AND DELANNOY PATHS--A TRIUMPH OF PAPER AND PENCIL
Lattice chains and Delannoy paths represent two ways to progress through a finite integer lattice. Recent computational techniques reveal some deep and fascinating connections between the two, but the complexity of counting these objects rises quickly with the dimension, limiting even the most powerful computers to very modest results. However, using nothing more than paper, pencil, and some classical counting techniques, we gain new insight into these questions and prove a number of results that are computationally inaccessible.
Friday, October 9, 2009
Smith Memorial Student Union 328
(Refreshments served at 3:00 in Smith 328)
*Sponsored by the Maseeh Mathematics and Statistics Colloquium Series Fund and the Department of Mathematics & Statistics