COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
Configuration Spaces of GraphsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact cbz20. The configuration space of a finite number of particles in a topological space is an object of interest in many areas of mathematics, in particular if the ambient space is a manifold. While the geometry of configuration spaces of manifolds is understood quite well, the case of particles in general simplicial complexes remains rather mysterious, even for 1-dimensional complexes. In this talk, I will describe an efficient combinatorial model for configurations of particles in a finite graph, which was first defined by Jacek Światkowski. Afterwards, I will sketch the other techniques we used to prove torsion-freeness and representation stability of those configuration spaces’ homology. This talk is part of the Junior Geometry Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsGeometry in Science Engineering - Mechanics and Materials Seminar Series Beyond the Neuron - Cambridge Neuroscience theme seminar series Explore Islam Week 2013 School of Technology Research Funding Masterclasses Cambridge Science FestivalOther talksStrong Bonds, Affective Labour: Sexually Transmitted Infections and the Work of History How to lead a happy life in the midst of uncertainty The Most Influential Living Philosopher? Summer Cactus & Succulent Show Whence the force of the law? John Rawls and the course of American legal philosophy |