Lecture 13 . Enumerative Combinatorics (Federico Ardila)

preview_player
Показать описание
We discuss the "Symbolic Method" for *labeled* combintaorial objects and their *exponential*. We use it to revisit and better explain the generating functions that we have computed so far. We also use it to enumerate involutions (permutations who are their own inverse) and derangements (permutations with no fixed points).

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.
Рекомендации по теме
Комментарии
Автор

Could one explain the y^k not needing the /k! because it is only counting components and not considering any labeling on them, whereas we are labeling the objects z^n is counting?

ub
Автор

I see you are in San Francisco, and so you may know Sal Khan of Khan Academy. These videos I think deserve a home like that of KA's. The hard work has really already been done. I think it would make a huge contribution to math/science community if interactives/exercises/demos could be made to augment/support the already great lectures.

ub