Text only print
Full screen print
Tuesday Seminar on Topology
Seminar information archive ～06/30｜Next seminar｜Future seminars 07/01～
| Date, time & place | Tuesday 17:00 - 18:30 056Room #056 (Graduate School of Math. Sci. Bldg.) |
|---|---|
| Organizer(s) | HABIRO Kazuo, KAWAZUMI Nariya, KITAYAMA Takahiro, SAKASAI Takuya |
2025/07/08
17:00-18:30 Room #hybrid/056 (Graduate School of Math. Sci. Bldg.)
Pre-registration required. See our seminar webpage.
Hiroki Ishikura (The University of Tokyo)
Stallings-Swan’s Theorem for Borel graphs (JAPANESE)
https://park.itc.u-tokyo.ac.jp/MSF/topology/TuesdaySeminar/index_e.html
Pre-registration required. See our seminar webpage.
Hiroki Ishikura (The University of Tokyo)
Stallings-Swan’s Theorem for Borel graphs (JAPANESE)
[ Abstract ]
A Borel graph is a simplicial graph on a standard Borel space X such that the edge set is a Borel subset of X^2. Such objects have been studied in the context of countable Borel equivalence relations, and recently there are many attempts to apply the ideas of geometric group theory to them. Stallings-Swan's theorem states that groups of cohomological dimension 1 are free groups. We will talk about an analog of this theorem for Borel graphs: A Borel graph on X with uniformly bounded degrees of cohomological dimension 1 is Lipschitz equivalent to a Borel acyclic graph on X. This is proved by establishing a criterion for certain decomposition of Borel graphs, which is inspired by Dunwoody's work on accessibility of groups.
[ Reference URL ]A Borel graph is a simplicial graph on a standard Borel space X such that the edge set is a Borel subset of X^2. Such objects have been studied in the context of countable Borel equivalence relations, and recently there are many attempts to apply the ideas of geometric group theory to them. Stallings-Swan's theorem states that groups of cohomological dimension 1 are free groups. We will talk about an analog of this theorem for Borel graphs: A Borel graph on X with uniformly bounded degrees of cohomological dimension 1 is Lipschitz equivalent to a Borel acyclic graph on X. This is proved by establishing a criterion for certain decomposition of Borel graphs, which is inspired by Dunwoody's work on accessibility of groups.
https://park.itc.u-tokyo.ac.jp/MSF/topology/TuesdaySeminar/index_e.html
