- Start Date:
June 3, 2011
- Event Start Time:
11:00 AM
- Event End Time:
12:00 PM
- Organizers:
Gene Fiorini
- Seminar Series:
REU Seminar
- Presenter(s):
Vidit Nanda - Rutgers University
- Event Location:
DIMACS Seminar room
- Abstract:
Let's say we have a graph. No, not the kind with X and Y axes, the kind that has edges and vertices. A cycle in this graph is a sequence of distinct edges so that traversing them in order brings us back to the starting vertex. We will see an algorithm that lets us quickly count the number of cycles in any graph. We will then start trying to count cycles in structures that are slightly more complicated than the graphs than you have already seen. Along the way, we will alsoencounter simplicial complexes, boundary operators and some elementary computational homology.
