Abstract:

Leinster introduced the magnitude of an enriched category, an invariant polynomial. The magnitude homology was invented as a categorification of the magnitude for a graph by Hepworth and Willerton. In general, it is difficult to compute the magnitude homology even for a very simple graph. In this talk, the speaker shows an approach to the magnitude homology of an arbitrary graph, which computes just the homology of a quotient of a simplicial complex. This result is based on a joint work with Yasuhiko Asao (The university of Tokyo).

744 Motooka, Nishi-ku

Fukuoka 819-0395, Japan

TEL (Office): +81-92-802-4402

FAX (Office): +81-92-802-4405

##### IMI(Institute of Mathematics for Industry)

# Seminar

List | All(1090) | Today and tomorrow's seminars(1) |

## Geometric approach to graph magnitude homology

Hold Date | 2020-01-24 15:20～2020-01-24 15:50 | |

Place | Lecture Room S W1-C-514, West Zone 1, Ito campus, Kyushu University | |

Object person | ||

Speaker | Kengo IZUMIHARA (Kyushu University) | |