Table of Contents
Fetching ...

Calculating Higher Digraph Homotopy Groups

Stephen Theriault, Jie Wu, Shing-Tung Yau, Mengmeng Zhang

TL;DR

The paper develops a systematic framework for higher digraph homotopy groups by introducing relative digraph homotopy groups, digraph suspension, and a digraph Hurewicz map. It proves a long exact sequence for based digraph pairs, constructs a compatible suspension that interplays with cubical and GLMY homology, and establishes that the Hurewicz map commutes with suspension. This machinery reduces the problem of computing higher digraph homotopy groups to degree-1 path homology and enables explicit existence results: for every $n\ge1$ there are digraphs with nontrivial $\overline{\pi}_n$ including $\mathbb{Z}$-summands, higher-rank free parts, and torsion. Consequently, nontrivial higher digraph homotopy groups exist in great variety, enriching GLMY theory and bridging digraph topology with combinatorial homology. The results also suggest a path toward broader computations via the abelianization of $\pi_1$ and suspensions, opening avenues for further torsion phenomena in higher degrees.

Abstract

We give the first tractable and systematic examples of nontrivial higher digraph homotopy groups. To do this we define relative digraph homotopy groups and show these satisfy a long exact sequence analogous to the relative homotopy groups of spaces. We then define digraph suspension and Hurewicz homomorphisms and show they commute with each other. The existence of nontrivial digraph homotopy groups then reduces to the existence of corresponding groups in the degree 1 path homology of digraphs.

Calculating Higher Digraph Homotopy Groups

TL;DR

The paper develops a systematic framework for higher digraph homotopy groups by introducing relative digraph homotopy groups, digraph suspension, and a digraph Hurewicz map. It proves a long exact sequence for based digraph pairs, constructs a compatible suspension that interplays with cubical and GLMY homology, and establishes that the Hurewicz map commutes with suspension. This machinery reduces the problem of computing higher digraph homotopy groups to degree-1 path homology and enables explicit existence results: for every there are digraphs with nontrivial including -summands, higher-rank free parts, and torsion. Consequently, nontrivial higher digraph homotopy groups exist in great variety, enriching GLMY theory and bridging digraph topology with combinatorial homology. The results also suggest a path toward broader computations via the abelianization of and suspensions, opening avenues for further torsion phenomena in higher degrees.

Abstract

We give the first tractable and systematic examples of nontrivial higher digraph homotopy groups. To do this we define relative digraph homotopy groups and show these satisfy a long exact sequence analogous to the relative homotopy groups of spaces. We then define digraph suspension and Hurewicz homomorphisms and show they commute with each other. The existence of nontrivial digraph homotopy groups then reduces to the existence of corresponding groups in the degree 1 path homology of digraphs.

Paper Structure

This paper contains 12 sections, 28 theorems, 164 equations.

Key Result

Theorem 1.1

Let $(G,A)$ be a based digraph pair. Then there is a long exact sequence \xymatrix@C=0.5cm{ \cdots\ar[r]&\overline{\pi}_{n+2}(G,A)\ar[r]^-{\partial_{n+2}} &\overline{\pi}_{n+1}(A) \ar[r]^{i_{n+1}}& \overline{\pi}_{n+1}(G) \ar[r]^-{j_{n+1}}& \overline{\pi}_{n+1}(G,A)\ar[r]^-{\partial_{n+1}}&

Theorems & Definitions (70)

  • Theorem 1.1
  • Theorem 1.2
  • Theorem 1.3
  • Definition 2.1
  • Example 2.2
  • Definition 2.3
  • Definition 2.4
  • Definition 3.1
  • Example 3.2
  • Definition 3.3
  • ...and 60 more