Discrete homotopy groups of cubical sets

arXiv:2606.28693 · math.AT, math.CO · Submitted 2026-06-27 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "Discrete homotopy groups of cubical sets".

Emmy: Here's the gist of the paper. Discrete homotopy groups of cubical sets extend discrete homotopy theory from graphs to arbitrary cubical sets and establish a combinatorial description for their homotopy groups <ref:2606.28693#pg2>.

Ada: The paper introduces the notion of discrete homotopy groups for quasisymmetric cubical sets and proves that they are naturally isomorphic to the homotopy groups of their geometric realizations <ref:2606.28693#pg15>.

Emmy: Extension to Quasisymmetric Cubical Sets The authors extend the notion of discrete homotopy groups of graphs to arbitrary cubical sets, showing that the discrete homotopy groups of quasisymmetric cubical sets are naturally isomorphic to the homotopy groups of their geometric realizations <ref:2606.28693#pg2>.

Ada: They define a quasisymmetric cubical set by adjoining coordinate permutation symmetries compatible with faces and degeneracies, but not necessarily connections <ref:2606.28693#pg3>.

Paper summary: Ada: So to wrap up this paper "Discrete homotopy groups of cubical sets," the authors have successfully shown that for quasisymmetric cubical sets, their discrete homotopy groups are naturally isomorphic to the homotopy groups of their geometric realizations, and they've established a Hurewicz theorem for these groups.

Emmy: That’s the core achievement. They built a combinatorial description for these groups by defining quasisymmetric cubical sets and using an adjunction to build that construction combinatorially without needing connections.

Kolya: What this means for us is that we have a systematic way to calculate the homotopy invariants of these spaces just by looking at their underlying discrete structure, provided they meet the quasisymmetric criteria.

Ada: And the implication is that it provides a concrete computational tool for relating algebraic structures to topological properties in this setting, which is useful when you're working with these kinds of structured sets.

Emmy: The limitation remains that this powerful machinery isn't guaranteed to work for every arbitrary cubical set; it stops being mysterious when the structure loses those specific coordinate permutation symmetries.

Kolya: And they are still asking hard questions about whether a weak equivalence between general cubical sets guarantees isomorphisms on these discrete homotopy groups, which is a big open problem.

Ada: So the title "Discrete homotopy groups of cubical sets" points to a paper that’s successfully extending graph theory concepts into the realm of arbitrary cubical sets while establishing a clear combinatorial link to their geometric realizations for quasisymmetric cases.

Conclusion: Ada: So we’re wrapping up this look at "Discrete homotopy groups of cubical sets." Basically, these authors took what we know about graphs and extended it to much bigger structures called quasisymmetric cubical sets.

Emmy: Right, they proved that for these specific types of sets, the discrete homotopy groups match the actual topological homotopy groups you get from their geometric realizations. It’s a nice combinatorial description.

Kolya: So what does this mean for us? It means we have a way to calculate how these complex shapes loop or connect just by looking at how they are built up discretely, as opposed to trying to visualize the whole thing in continuous space.

Ada: Exactly. It turns the abstract problem of calculating homotopy groups into a concrete puzzle about the set's underlying structure. The authors didn't even need those complicated connections they mentioned earlier; it’s all about how the pieces fit together combinatorially.

Emmy: And they did this by building a specific way to turn any cubical set into something called a quasisymmetric Kan complex, which is where the real structure comes out. That process gives them that isomorphism we talked about.

Kolya: I'm still thinking about how much control that gives us. If we can calculate it combinatorially, can we use these numbers to understand the physics or geometry of those larger sets? What are the constraints on those calculations?

Ada: That’s a big question for future work. The paper shows this works beautifully for quasisymmetric sets, but it leaves things open when you move away from that specific symmetry.

Emmy: And they actually pointed out some real problems they're still trying to solve, like finding cases where the discrete homotopy groups are non-trivial even if the set isn't quasisymmetric.

Kolya: I agree. It suggests that maybe this combinatorial method is really just a very strong tool for a specific class of shapes, and we need to figure out what’s missing for the general case.

DAISUKE KISHIMOTO, YICHEN TONG

Kyushu University · Westlake Institute of Advanced Study

math.AT, math.CO

Submitted: 2026-06-27

Updated: 2026-11-03

Comments: We replace $\mathcal{G}_0\$ by $\mathrm{Ex}^{\infty}$ in the proofs of the comparison and Hurewicz theorems for quasisymmetric cubical sets. We revise the definition of $\mathcal{S}$, and also reformulate grids as cubical maps from geometric products of zigzags

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 80/100

The gist: Discrete homotopy groups of cubical sets extend discrete homotopy theory from graphs to arbitrary cubical sets and establish a combinatorial description for their homotopy groups <ref:2606.28693#pg2>.

Key concepts

Discrete Homotopy Groups
These are algebraic invariants defined combinatorially for cubical sets, generalizing graph homotopy groups. They provide a way to study the connectivity and structure of these sets using purely combinatorial methods, linking them to topological concepts like geometric realization.
Quasisymmetric Cubical Sets
These are a specific type of cubical set defined by adding coordinate permutation symmetries that respect faces and degeneracies. This symmetry allows for a controlled combinatorial description, which is crucial for proving the key results about their homotopy groups being equivalent to those of their geometric realizations.
Geometric Realization
This is the topological space obtained by realizing a cubical set, essentially gluing together cubes according to the set's structure. The paper proves that for quasisymmetric cubical sets, the discrete homotopy groups are naturally isomorphic to the standard homotopy groups of this resulting topological space.
Hurewicz Theorem
This theorem relates the discrete homotopy groups of a structure (like a directed graph or quasisymmetric cubical set) to its homology or fundamental group. The paper establishes a combinatorial version for these structures, showing how connectivity properties translate into specific algebraic isomorphisms.

Terminology

Summary

Discrete homotopy groups of cubical sets extend discrete homotopy theory from graphs to arbitrary cubical sets and establish a combinatorial description for their homotopy groups <ref:2606. p. 0

Where the paper says it

It is therefore natural to expect that discrete homotopy theory can be extended from graphs to cubical sets, with the discrete homotopy theory of graphs embedded via the 1-nerve construction. In this paper, we extend the notion of discrete homotopy groups of graphs to arbitrary cubical sets in a purely combinatorial manner, in contrast to the definition of the homotopy groups of cubical Kan complexes [12].

28693#pg2>. The paper introduces the notion of discrete homotopy groups for quasisymmetric cubical sets and proves that they are naturally isomorphic to the homotopy groups of their geometric realizations <ref:2606. p. 0
Where the paper says it

DISCRETE HOMOTOPY GROUPS OF CUBICAL SETS DAISUKE KISHIMOTO AND YICHEN TONG Abstract. We extend the notion of discrete homotopy groups of graphs to arbitrary cubical sets, and show that the discrete homotopy groups of quasisymmetric cubical sets are naturally isomorphic to the homotopy groups of their geometric realizations.

28693#pg15>.

Extension to Quasisymmetric Cubical Sets

The authors extend the notion of discrete homotopy groups of graphs to arbitrary cubical sets, showing that the discrete homotopy groups of quasisymmetric cubical sets are naturally isomorphic to the homotopy groups of their geometric realizations <ref:2606.28693#pg2>. They define a quasisymmetric cubical set by adjoining coordinate permutation symmetries compatible with faces and degeneracies, but not necessarily connections <ref:2606. p. 1

Where the paper says it

However, the category □ itself is not endowed with this symmetry. We define a quasisymmetric cubical set by adjoining coordinate permutation symmetries that are required to be compatible with faces and degeneracies, but not necessarily with connections.

28693#pg3>. They provide a purely combinatorial construction of the left adjoint of the forgetful functor from quasisymmetric cubical sets to cubical sets and prove that the unit of this adjunction is an objectwise weak equivalence <ref:2606. p. 0
Where the paper says it

Here, quasisymmetric cubical sets are cubical sets equipped with coordinate permutation symmetries that are compatible with faces and degeneracies, but not necessarily with connections. We give a purely combinatorial construction of the left adjoint of the forgetful functor from the category of quasisymmetric cubical sets to the category of cubical sets, and prove that the unit of this adjunction is an objectwise weak equivalence.

28693#pg16>.

Combinatorial Construction and Weak Equivalence

The paper constructs a functorial fibrant replacement which sends a cubical set to a quasisymmetric Kan complex, leading to a natural isomorphism between the homotopy groups of arbitrary cubical sets and those of pointed Kan complexes <ref:2606.28693#pg16>. This relies on Theorem 1. p. 0

Where the paper says it

They showed that the homotopy groups of the geometric realization of N1𝐺 are naturally isomorphic to the discrete homotopy groups of 𝐺, thereby proving the conjecture. Their proof relies on applying an appropriate fibrant replacement to the cubical set N1𝐺.

2, which states that one can combinatorially construct the left adjoint S: cSet → QSymcSet of the forgetful functor U: QSymcSet → cSet such that the unit 1cSet ⇒ US is an objectwise weak equivalence <ref:2606. p. 1
Where the paper says it

As a consequence, we obtain a combinatorial description of the homotopy groups of the geometric realization of an arbitrary cubical set. One can combinatorially construct the left adjoint S: cSet → QSymcSet of the forgetful functor U: QSymcSet → cSet such that the unit 1cSet ⇒ US is an objectwise weak equivalence.

28693#pg16>.

Hurewicz Theorem and Directed Graphs

The paper establishes a combinatorial description of the homotopy groups of the geometric realization of an arbitrary cubical set, which is not necessarily a Kan complex <ref:2606.28693#pg16>. It applies Theorem 1. p. 0

Where the paper says it

As a consequence, we obtain a purely combinatorial description of the homotopy groups of the geometric realizations of arbitrary cubical sets. As an application, we establish the Hurewicz theorem for the discrete homotopy groups of quasisymmetric cubical sets.

3 to establish the Hurewicz theorem for the discrete homotopy groups of quasisymmetric cubical sets <ref:2606. p. 0
Where the paper says it

As a consequence, we obtain a purely combinatorial description of the homotopy groups of the geometric realizations of arbitrary cubical sets. As an application, we establish the Hurewicz theorem for the discrete homotopy groups of quasisymmetric cubical sets.

28693#pg16>. This generalizes the Hurewicz theorem for directed graphs, showing that if a directed graph is (n-1)-connected, then a specific homomorphism is an isomorphism for n ≥ 2. p. 2
Where the paper says it

If 𝐺 is (𝑛 − 1)-connected, then the homomorphism ℎ∗ : ¯𝜋𝑛 (𝐺, 𝑣) → QH𝑛 (𝐺) is the abelianization for 𝑛 = 1 and an isomorphism for 𝑛 ≥ 2. Since the first path homology group and the first singular cubical homology group of a directed graph are isomorphic, our Hurewicz theorem generalizes the one in [21].

Homotopy Groups of Directed Graphs

The discrete homotopy groups of directed graphs are identified with the homotopy groups of their 1-nerve, and it is shown that these groups coincide with the singular cubical homology groups of a directed graph. The Hurewicz map for pointed directed graphs is shown to coincide with the Hurewicz map for their 1-nerve, generalizing results from [27]. p. 2

Where the paper says it

We introduce the 1-nerve N1𝐺 of a directed graph 𝐺, analogous to the 1-nerve of a graph, which is automatically a symmetric cubical set. By identifying the homomorphism ℎ∗ : ¯𝜋𝑛 (𝐺, 𝑣) → QH𝑛 (𝐺) with the discrete Hurewicz map ℎ∗ : 𝜋 𝛿 𝑛 (N1𝐺, 𝑣) → 𝐻𝑛 (N1𝐺), we establish the following result by applying Theorem 1.

Discrete Homotopy Groups of Quasisymmetric Cubical Sets

The paper proves that the discrete homotopy groups of a quasisymmetric cubical set are naturally isomorphic to the homotopy groups of its geometric realization, and it also proves the Hurewicz theorem for these groups. This result is achieved by showing that G0R X is a Kan complex when X is signed quasisymmetric and using the isomorphism between discrete and topological homotopy groups. p. 1

Where the paper says it

2 with the constructions of Section 5, we obtain a functorial fibrant replacement which sends a cubical set to a quasisymmetric Kan complex. Consequently, for any pointed Kan complex (𝑋, 𝑥0) which is not necessarily quasisymmetric, this fibrant replacement, together with the homotopy invariance of the discrete homotopy groups, yields a natural isomorphism 𝜋∗ (𝑋, 𝑥0) 𝜋 𝛿 ∗ (𝑋, 𝑥0).

Comparison with Simplicial Theory

The paper introduces a naive cubical analogue of the Ex∞ functor in simplicial homotopy theory and compares it with G0, showing that G0X is a Kan complex whenever X is signed quasisymmetric. The functor Ex∞ satisfies properties analogous to those in simplicial homotopy theory, and it is shown that Ex∞ X is a Kan complex whenever X is signed quasisymmetric. p. 2

Where the paper says it

In Section 3, we define the discrete homotopy groups for general cubical sets and discuss their properties. In Section 4, we recall the (signed) symmetric cubical category and the category of (signed) symmetric cubical sets, and then generalize them to the (signed) quasisymmetric cubical category and the category of (signed) quasisymmetric cubical sets.

Directed Graph Homotopy Groups

The discrete homotopy groups of directed graphs are defined as the discrete homotopy groups of their 1-nerve, and the Hurewicz theorem for directed graphs is shown to be a generalization of the Hurewicz theorem for undirected graphs. The comparison of nerves identifies the graph-theoretic A-groups with the discrete homotopy groups of the directed replacement G as follows. p. 0

Where the paper says it

Their proof relies on applying an appropriate fibrant replacement to the cubical set N1𝐺. The discrete homotopy groups of a graph 𝐺 admit an interpretation in terms of cubes in the cubical set N1𝐺.

p. 0
Where the paper says it

Their proof relies on applying an appropriate fibrant replacement to the cubical set N1𝐺. The discrete homotopy groups of a graph 𝐺 admit an interpretation in terms of cubes in the cubical set N1𝐺.

Conclusion and Open Problems

The paper concludes by noting that while discrete homotopy groups can be defined for an arbitrary cubical set, they remain mysterious when X is not quasisymmetric. It poses several open problems, including finding a non-quasisymmetric cubical set with nontrivial higher discrete homotopy groups and proving or disproving whether a weak equivalence between cubical sets induces isomorphisms on discrete homotopy groups. p. 1

Where the paper says it

Let cSet and SymcSet denote the categories of cubical sets and symmetric cubical sets. In [24], Isaacson showed that the forgetful functor U: SymcSet → cSet admits a left adjoint F: cSet → SymcSet such that the unit 1cSet ⇒ UF is an objectwise weak equivalence, where a weak equivalence is a cubical map that induces isomorphisms on homotopy groups of geometric realizations with respect to all basepoints.

The paper also asks how to construct combinatorially homotopy operations on discrete homotopy groups and the action of the fundamental group on higher discrete homotopy groups. p. 1
Where the paper says it

In this paper, we combinatorially and explicitly construct the left adjoint of the forgetful functor U: QSymcSet → cSet, and prove the following second main result. As a consequence, we obtain a combinatorial description of the homotopy groups of the geometric realization of an arbitrary cubical set.

Discrete Homotopy Groups of Directed Graphs

The paper recalls basic notions concerning directed graphs, defines the 1-nerve of a directed graph and defines the discrete homotopy groups and homology groups to be those of its 1-nerve, extending the discrete homotopy groups of graphs introduced in [6, 8]. The Hurewicz theorem for directed graphs is shown to be a generalization of the Hurewicz theorem for undirected graphs proved in [13]. p. 2

Where the paper says it

Since the first path homology group and the first singular cubical homology group of a directed graph are isomorphic, our Hurewicz theorem generalizes the one in [21]. We also provide an alternative proof of the Hurewicz theorem for graphs, which was originally proved in [13].

Homotopy Theory of Cubical Sets

The paper details the structure of cubical sets, including products, geometric realization, and homotopy groups, and shows that the category cSet carries a model category structure Quillen equivalent to Top via geometric realization. It also defines various functors like R, G, G0: cSet → cSet which correspond to the inverse, multiplication and the unit in the discrete homotopy group respectively. p. 1

Where the paper says it

Let cSet and SymcSet denote the categories of cubical sets and symmetric cubical sets. In [24], Isaacson showed that the forgetful functor U: SymcSet → cSet admits a left adjoint F: cSet → SymcSet such that the unit 1cSet ⇒ UF is an objectwise weak equivalence, where a weak equivalence is a cubical map that induces isomorphisms on homotopy groups of geometric realizations with respect to all basepoints.

Directed Grid Homotopy

The paper introduces a combinatorial abstraction of gluing cubes as concatenation of grids and defines various homotopies between grids, including 0-homotopy, 1-homotopy, and homotopy. The definition of the discrete homotopy groups involves spherical grids and a group structure defined by multiplication. p. 0

Where the paper says it

In this paper, we extend the notion of discrete homotopy groups of graphs to arbitrary cubical sets in a purely combinatorial manner, in contrast to the definition of the homotopy groups of cubical Kan complexes [12]. Carranza and Kapulkin [12] defined homotopy equivalences of cubical sets in close analogy with Date: July 10, 2026.

Hurewicz Map Construction

The discrete Hurewicz map is constructed by assigning signs to the constituent cubes of a grid, which records the number of coordinate directions traversed in reverse. This map is well-defined because degenerate cubes are trivial in Nn X. p. 8

Where the paper says it

Let 𝑓 : (𝑋, 𝑥0) → (𝑌, 𝑦0) be a pointed cubical map between pointed Kan complexes. Then 𝑓∗ : 𝜋𝑛 (𝑋, 𝑥0) → 𝜋𝑛 (𝑌, 𝑦0), [𝑥] ↦→ [ 𝑓 (𝑥)] is well defined.

p. 8
Where the paper says it

Let 𝑓 : (𝑋, 𝑥0) → (𝑌, 𝑦0) be a pointed cubical map between pointed Kan complexes. Then 𝑓∗ : 𝜋𝑛 (𝑋, 𝑥0) → 𝜋𝑛 (𝑌, 𝑦0), [𝑥] ↦→ [ 𝑓 (𝑥)] is well defined.

The map satisfies the required properties, and it is a homomorphism by Proposition 6. p. 8
Where the paper says it

Moreover, for 𝑛 ≥ 1, it is a group homomorphism. Proposition 2.

p. 8
Where the paper says it

Moreover, for 𝑛 ≥ 1, it is a group homomorphism. Proposition 2.

4.

The Role of Fibrant Replacement

The fibrant replacement is constructed as a key ingredient in proving Theorems 1.1 and 1.3, which rely on the combinatorial description of homotopy groups. p. 0

Where the paper says it

We give a purely combinatorial construction of the left adjoint of the forgetful functor from the category of quasisymmetric cubical sets to the category of cubical sets, and prove that the unit of this adjunction is an objectwise weak equivalence. As a consequence, we obtain a purely combinatorial description of the homotopy groups of the geometric realizations of arbitrary cubical sets.

The construction involves reversing cube coordinates and verifying the cubical identities. p. 1
Where the paper says it

DISCRETE HOMOTOPY GROUPS OF CUBICAL SETS 2 homotopy equivalences of topological spaces, and the discrete homotopy groups of cubical sets are invariant under homotopy equivalences. Every 𝑛-cube is the product of 𝑛 copies of the 1-cube, and thus every cube carries an intrinsic symmetry arising from permutations of its coordinates.

The Role of G0 and Ex∞

The functor G0 helps in understanding the homotopy groups of a cubical set, as it allows grids of arbitrary size modulo 0-homotopy. The functor Ex∞ is constructed similarly to the simplicial homotopy theory, and it is shown that Ex∞ X is a Kan complex whenever X is signed quasisymmetric. p. 8

Where the paper says it

Since 𝑋 is a Kan complex, the cubical map ℎ extends to a cubical map ℎ¯ : □ 𝑛+1 → 𝑋. As shown in [12], the homotopy class of a cubical map ℎ¯|□𝑛+1𝜕𝑛+1,1 : (□ 𝑛 , 𝜕□ 𝑛 ) → (𝑋, 𝑥0) is independent of the choice of extension ℎ¯.

The discrete homotopy groups of directed graphs are defined as the discrete homotopy groups of their 1-nerve, and the Hurewicz theorem for directed graphs is shown to be a generalization of the Hurewicz theorem for undirected graphs proved in [13]. The comparison of nerves identifies the graph-theoretic A-groups with the discrete homotopy groups of the directed replacement G as follows.

The Hurewicz Map

The discrete Hurewicz map is constructed by assigning signs to the constituent cubes of a grid, which records the number of coordinate directions traversed in reverse. This map is well-defined because degenerate cubes are trivial in Nn X. The map satisfies the required properties, and it is a homomorphism by Proposition 6.4.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Direct computation of discrete homotopy groups for arbitrary cubical sets: The system can compute discrete homotopy groups for any cubical set by using a purely combinatorial construction of a left adjoint to the forgetful functor from quasisymmetric cubical sets to cubical sets, as detailed in Theorem 1.2.

  2. Combinatorial description of topological invariants: The AI can obtain a purely combinatorial description of the homotopy groups of the geometric realization of an arbitrary cubical set using the results derived from Theorem 1.1 and Theorem 5.5, which show that discrete homotopy groups are naturally isomorphic to the homotopy groups of their geometric realizations for quasisymmetric cubical sets.

  3. Verification of Hurewicz theorem for directed graphs: The system can verify the Hurewicz theorem for directed graphs by applying Lemma 7.11 to the 1-nerve N1G, showing that if a pointed directed graph (G, v) is (n - 1)-connected, the homomorphism hstar: pi delta n(G, v) -> QH n(G) is an isomorphism for n >= 2.

  4. Analysis of non-quasisymmetric cubical sets: The system can address Problem 6.5 by attempting to find a non-quasisymmetric cubical set with nontrivial higher discrete homotopy groups, leveraging the context that we do not know any examples of non-quasisymmetric cubical sets with nontrivial higher discrete homotopy groups.

  5. Combinatorial construction of fibrant replacements: The system can construct an explicit fibrant replacement for a quasisymmetric cubical set by implementing the functor R, which is defined by reversing cube coordinates, as described in Section 5.1.

  6. Computation of signed symmetric cubical set properties: The AI can analyze signed symmetric cubical sets using the identities (4.5) and (4.6), which are sufficient for the Kan condition, allowing it to treat these objects as signed quasisymmetric cubical sets in many contexts.

  7. Construction of directed graph homotopy groups: The system can define and compute the n-th homotopy group of a pointed directed graph (G, v) by defining it as pi delta n(N1G, v), where N1G is the 1-nerve of G, as established in Proposition 7.18.

  8. Computation of discrete Hurewicz map for graphs: The system can compute the discrete Hurewicz map hstar: pi delta n(G, v) -> QH n(G) by using the formula sum over i1,..., in sgn i1,..., in (f) f i1,..., in, as defined in Proposition 6.2.

Abstract

We extend the notion of discrete homotopy groups of graphs to arbitrary cubical sets, and show that the discrete homotopy groups of quasisymmetric cubical sets are naturally isomorphic to the homotopy groups of their geometric realizations. Here, quasisymmetric cubical sets are cubical sets equipped with coordinate permutation symmetries that are compatible with faces and degeneracies, but not necessarily with connections. We give a purely combinatorial construction of the left adjoint of the forgetful functor from the category of quasisymmetric cubical sets to the category of cubical sets, and prove that the unit of this adjunction is a natural weak equivalence. As a consequence, we obtain a purely combinatorial description of the homotopy groups of the geometric realizations of arbitrary cubical sets. As an application, we establish the discrete Hurewicz map from the discrete homotopy groups of a cubical set to the homology groups, and prove a Hurewicz theorem with respect to the discrete Hurewicz map whenever the cubical set is quasisymmetric. Applied to the 1-nerve of a directed graph, it also yields a Hurewicz theorem relating the homotopy groups of Li, Wu, Yau, and Zhang to singular cubical homology.

Sources

Related papers