Lecture 19 . Enumerative Combinatorics (Federico Ardila)
Автор: Federico Ardila
Загружено: 2013-11-05
Просмотров: 1524
Описание:
We discuss the Lindström-Gessel-Viennot lemma, which expresses the number of routings in a directed graph in terms of a determinant. We use it to give a combinatorial interpretation of "binomial determinants".
Lecture notes at: http://math.sfsu.edu/federico/ec.html
San Francisco State University (San Francisco, USA)
Universidad de Los Andes (Bogota, Colombia)
Partially supported by:
US National Science Foundation CAREER Award DMS-0956178
US National Science Foundation Grant DMS-0801075
SFSU-Colombia Combinatorics Initiative.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке: