Javascript must be enabled

Phil Hanlon : The Combinatorial Laplacian

The combinatorial laplacian is a method for computing the rational homology of an algebraic or simplicial complex. Although the method is quite old, it has recently been applied with success to a number of problems in algebraic combinatorics. We will survey the method and describe some of these recent applications.

Please select playlist name from following

Report Video

Please select the category that most closely reflects your concern about the video, so that we can review it and determine whether it violates our Community Guidelines or isn’t appropriate for all viewers. Abusing this feature is also a violation of the Community Guidelines, so don’t do it.


Comments Disabled For This Video