Abstract

The aim of the talk is to show that magnitude cohomology yields finitely generated modules over categories of (directed) graphs with bounded genus. We will use the theory of quasi-Groebner categories, as recently developed by Sam and Snowden, and present the case of directed graphs. Then, we will discuss two main consequences. First, the ranks of magnitude homology of graphs with bounded genus, in a fixed degree, grow at most polynomially in the number of vertices. Second, the order of its torsion, in each fixed degree, is bounded.

Recap

Setting: is an undirected, connected, non-simple graph (quivers) Regular morphisms

Defintion A minor morphism is a map, that allows edges and vertices to be deleted. (As long as it contracts the graph)

Recall: where are the Chains of the Magntde homology.

We now define the Rank: . Computations:

  • complete graph, then the The Magnitude homology is equal to the homology chain.s
  • : The Magnitude is generated freely by the set of vertices.
  • is tree: The Homology is generated by the Edges for all

Question: Is there Torion in MH? Yes, sometimes.

Representation theory of sets

Application