Discrete homotopy groups of cubical sets
summary
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>.
In short
This paper extends discrete homotopy groups from graphs to arbitrary cubical sets, focusing on quasisymmetric cubical sets. It introduces a combinatorial method to define these groups and proves they are isomorphic to the homotopy groups of their geometric realizations. The work also establishes a combinatorial description for the Hurewicz theorem in this context.
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 used across episodes
This episode discusses
- Discrete homotopy groups of cubical sets · Paper Radio
- On the equivalence of two approaches to multiplicative homotopy theories
- Derived mapping spaces of infinity-categories
- The discrete homotopy hypothesis for directed graphs
- Homologies of path complexes and digraphs
- Homotopy Groups and Puppe Sequence of Digraphs
- Calculating Higher Digraph Homotopy Groups
The paper
Discrete homotopy groups of cubical sets · Read on arXiv
DAISUKE KISHIMOTO, YICHEN TONG
Kyushu University · Westlake Institute of Advanced Study
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.
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.
More episodes
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes
- 2512.01536-Abelian approximations for bicrossed products
- 2601.02524-Lagrangian slice disks with symplectomorphic exteriors