Table of Contents
Fetching ...

On Matsushita $π_1^2$ discrete fundamental groups

Mike Krebs, Alan Pan, Anand Prakash

TL;DR

The paper develops Seifert–van Kampen-type tools for Matsushita's discrete fundamental group $\pi_1^2(X)$, both at the groupoid level and the group level, enabling computation of these invariants via graph covers that respect 4-cycles. It then proves a universality result: every group $G$ is realizable as $\pi_1^2(X)$ for some graph $X$, using a covering-theoretic construction and a carefully designed simply connected cover with a free $G$-action. The methods extend prior results for related discrete fundamental groups and provide a constructive approach to realize arbitrary groups as graph-based invariants. Overall, the work highlights the richness of $\pi_1^2(X)$ beyond the classical fundamental group of graphs and connects to classifying-space ideas through explicit coverings.

Abstract

The Matsushita fundamental groups of a graph $X$, denoted $π_1^r(X)$, are certain discrete versions of the fundamental group for topological spaces. For $r=2$, these groups have a nice combinatorial description, due to Sankar. In this paper we prove two results about $π_1^2$. First, we prove a Seifert-van Kampen-type theorem. Similar results have previously been obtained by Barcelo, et al. (and strengthened by Kapulkin and Mavinkurve) for a different notion of discrete fundamental group. Second, we prove that an arbitrary group $G$ can be realized as $π_1^2(X)$ for some graph $X$. Our construction works equally well for the aforementioned alternate discrete fundamental group, and our second result thus generalizes a theorem of Kapulkin and Mavinkurve which applies only to finitely presented groups $G$.

On Matsushita $π_1^2$ discrete fundamental groups

TL;DR

The paper develops Seifert–van Kampen-type tools for Matsushita's discrete fundamental group , both at the groupoid level and the group level, enabling computation of these invariants via graph covers that respect 4-cycles. It then proves a universality result: every group is realizable as for some graph , using a covering-theoretic construction and a carefully designed simply connected cover with a free -action. The methods extend prior results for related discrete fundamental groups and provide a constructive approach to realize arbitrary groups as graph-based invariants. Overall, the work highlights the richness of beyond the classical fundamental group of graphs and connects to classifying-space ideas through explicit coverings.

Abstract

The Matsushita fundamental groups of a graph , denoted , are certain discrete versions of the fundamental group for topological spaces. For , these groups have a nice combinatorial description, due to Sankar. In this paper we prove two results about . First, we prove a Seifert-van Kampen-type theorem. Similar results have previously been obtained by Barcelo, et al. (and strengthened by Kapulkin and Mavinkurve) for a different notion of discrete fundamental group. Second, we prove that an arbitrary group can be realized as for some graph . Our construction works equally well for the aforementioned alternate discrete fundamental group, and our second result thus generalizes a theorem of Kapulkin and Mavinkurve which applies only to finitely presented groups .

Paper Structure

This paper contains 9 sections, 5 theorems, 20 equations, 1 figure.

Key Result

Theorem 3.2

Let $\mathcal{U}$ be a cover of a graph $X$ by subgraphs, closed under pairwise intersection, such that every $4$-cycle in $X$ is contained in some $U\in\mathcal{U}$. Let $\mathcal{U}$ also denote the subcategory of $\mathsf{Set}$ whose objects are elements of $\mathcal{U}$ and whose morphisms are i Then the colimit exists and is with the natural transformation from $\Pi$ to $\Delta \Pi(X)$ given

Figures (1)

  • Figure 1: The basic "building block" graph $B$ for $\tilde{X}$

Theorems & Definitions (17)

  • Definition 2.1
  • Definition 2.2
  • Example 2.3
  • Example 2.4
  • Definition 3.1
  • Theorem 3.2
  • proof
  • Theorem 3.3
  • proof
  • Corollary 3.4
  • ...and 7 more