Word length, Morse theory, and Vietoris-Rips complexes

arXiv:2608.25614 · math.GR, math.MG · Submitted 2026-08-26 · 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: I'm Ada.

Emmy: And I'm Emmy, here with Kolya.

Ada: We're looking at the paper: "Word length, Morse theory, and Vietoris-Rips complexes".

Title and authors: Ada: So we're looking at this paper called Word length, Morse theory, and Vietoris–Rips complexes. It sounds like they're trying to use discrete Morse theory to figure out when these Vietoris-Rips complexes are highly connected or even contractible.

Emmy: Exactly. The core idea is using the word length of a group with a fixed generating set as an initial measurement to prove something about the topology of its Vietoris-Rips complex. It’s connecting metric properties, like how far apart points are in the group, to the connectivity of these geometric shapes we build from them.

Kolya: So if I'm thinking about this from a probabilistic side, what does this approach actually help us bound? Is it giving us a general way to control the connectivity when we don't have specific geometric constraints on the underlying metric space?

Ada: Well, they establish a general sufficient criterion based on Bestvina-Brady discrete Morse theory. They focus on finitely generated groups with a word metric coming from a finite generating set. The criterion is local, meaning it only depends on finite subsets of the group that have a fixed diameter and certain length conditions.

Emmy: And the specific function they use to set up the discrete Morse theory is defined as f(S) equals lenmin(S) plus S times N, and they show that this function actually works as a Morse function for their setup. That’s how they connect the group structure directly to the complex's structure.

Kolya: When you look at that, it means if we can control the behavior of that length function on these finite sets, we get some control over the overall connectivity of VRt(G). But what is a practical example?

Ada: As a proof-of-concept, they prove Theorem B which shows that for right-angled Artin groups with word metric and when the graph Gamma is triangle-free, the complex VR2(A Gamma) is contractible. That’s a big win because it gives us a concrete case where this approach works.

Emmy: They also provide some conditions related to the group being finitely presented based on checking connectivity of certain finite complexes. This suggests that we might be able to use these connectivity checks as a shortcut for determining if a group is finitely presented at all.

Kolya: So, if we look at the results for those right-angled Artin groups, what's the condition there? Is it just about avoiding triangles in the graph Gamma? What happens if we allow triangles in Gamma?

Title and authors: Ada: If Gamma has no three-cliques, then they show that elements in a set S have a unique common descending neighbor when their distance is two and their word lengths are constant on that set. This condition leads to the conclusion that VRt(A Gamma) is contractible for all t greater than or equal to two if Gamma is triangle-free.

Emmy: That result relies on Corollary three point four, which states that if Dt(S) is contractible for all such sets S, then the whole Vietoris-Rips complex VRt(X) is contractible <ref:2608.25614#pg2>. It’s like they showed a local condition implies a global one.

Kolya: That's a powerful implication because it means we don't have to check every single possible finite subset S to prove the entire complex is contractible, we just check those specific ones that satisfy the length constancy condition. But what about groups that aren't right-angled Artin groups? Does this approach generalize well?

Ada: The general goal of the paper is establishing a general sufficient criterion for VRt(G) to be highly connected or contractible using this discrete Morse theoretic approach, and they set up the framework for that. They are aiming for a broader application than just right-angled Artin groups.

Emmy: They also prove that if G has no odd-length cycles and there exists some odd t such that Dt(g) is connected for all g not equal to one, then G is finitely presented. That’s another structural result tied into this Morse theory framework.

Kolya: So what are the limitations of this approach? Where does it stop working, or what are the authors flagging as a sticking point? Is there a case where the word length function behaves in a way that breaks the Morse function they constructed?

Ada: The paper notes that they use distance to a fixed point as an initial measurement, but the focus is specifically on groups using word length. They don't discuss what happens when you move away from those specific metrics or when the group structure is more complex than finitely generated.

Emmy: And they acknowledge that their approach involves controlling both the diameter and also insisting on controlling how the length function changes, which makes it theoretically easier to handle than some other Morse theoretic approaches they compare it to in their setup.

Title and authors: Kolya: For someone who just listens to the show, what does this mean for a group theorist? If I'm trying to determine if my group's Vietoris-Rips complex is contractible, does this give me a concrete checklist?

Ada: It gives you a checklist based on checking connectivity of those specific finite complexes Dt(S) under the condition that the word length is constant on S. If they pass those checks, you get contractibility.

Emmy: And for algebraic geometers, it’s interesting how they set up the poset structure using these descending links to show that if len is not constant on S, then Dt(S) is contractible. That shows a direct link between the local structure of the group elements and the topological shape of the complex.

Kolya: I've been thinking about that unique common neighbor finding they mentioned earlier for right-angled Artin groups when elements are at distance two and have the same word length, based on Lemma four point six and Observation four point two. How does that actually translate into something useful outside of the RAAG context?

Ada: It’s a way to efficiently find relationships between group elements using their position in the metric space defined by the word length, which is a key step in showing contractibility for those specific groups.

Emmy: That's interesting because it shows that even in these highly structured groups, there are efficient ways to navigate the underlying geometry without needing to compute everything explicitly.

Kolya: So we've talked about the setup and some concrete results for right-angled Artin groups. Before we wrap up on this paper, what’s the final big picture implication for how we approach geometric group theory problems?

Ada: It suggests that discrete Morse theory, when paired with word length measurements, offers a systematic way to probe the contractibility of these complexes, even if it requires specific conditions like triangle-free graphs.

Emmy: And it shows that local information—the behavior on finite subsets S—can dictate the global topological shape of VRt(G) under certain algebraic constraints.

Kolya: I think what this paper really does is provide a new toolkit for geometric group theorists to test connectivity using tools they already have, just by framing the problem through a discrete Morse lens.

Ada: So that’s what we found in Word length, Morse theory, and Vietoris-Rips complexes. We'll be looking at more papers soon on how these techniques apply to other settings.

The paper's summary: Ada: So, to recap this paper, they’re using discrete Morse theory to tackle whether these Vietoris-Rips complexes for groups are connected or contractible by focusing on word length as their initial measurement.

Emmy: Right. It boils down to finding a general rule—a sufficient condition—that tells you when those complexes will be highly connected or even contractible, based on local conditions in the group structure.

Kolya: From my side, it’s about turning a complex topological question into something that can be checked by looking at specific finite subsets of the group, which is much more manageable than looking at everything at once.

Ada: They do establish this general sufficient criterion using Bestvina-Brady discrete Morse theory, and they show that the function they use to define their Morse function actually works with word length.

Emmy: And then they prove that if the length of those sets isn't constant, then the descending link of that set is contractible, which means you’re already getting some local topological control.

Kolya: But I want to know what this means for us in practice; it’s not just abstract math about posets and links.

Ada: It gives us a roadmap. If you can find those finite subsets that satisfy the length constancy condition, then the whole Vietoris-Rips complex ends up being contractible, provided those local checks pass.

Emmy: And they show this works for right-angled Artin groups when the underlying graph is triangle-free, which is a concrete case where you can actually prove contractibility for all large enough radii.

Kolya: That’s the numbers part—the radius of two, VR2, being contractible under those triangle-free conditions—but what about other groups? Does this general method work when the group structure gets more complicated than a right-angled Artin group?

Ada: The paper is setting up that general framework for any finitely generated group with a word metric. They are aiming for a broad criterion, not just one specific class of groups.

Emmy: And they also show this approach can be used to prove things about finite presentability, which is another big structural property you want to know about a group.

Kolya: So, if I’m trying to figure out if my group’s Vietoris-Rips complex is contractible, the method suggests checking those specific local conditions first before worrying about the whole thing.

Ada: Exactly. It turns a global topological question into a series of local checks based on word length and set sizes.

Emmy: And the structure they build using these descending links gives us a direct line between how group elements relate to each other and the shape of the complex they are building.

Kolya: We’ve seen how it works for right-angled Artin groups, but what does this imply for groups that aren't right-angled Artin groups? Does the method stop working when you introduce more complex relations?

Ada: They are trying to establish a general sufficient condition, so they’re pushing past just the RAAG case. The goal is to find that universal rule.

Emmy: And they also proved some things about odd-length cycles and the connectivity of descending links for general groups, which touches on how group structure limits topological freedom.

Kolya: So this paper provides a new toolkit for geometric group theorists to test connectivity using tools already available, just by framing the problem through this discrete Morse lens.

Ada: That’s the big picture—systematic testing of contractibility using word length measurements. We’ll see if these results hold up when we try to apply them to other types of groups next.

The paper's improvements: Ada: So, we’ve talked about how discrete Morse theory helps us check connectivity in Vietoris–Rips complexes using word length, and now we’re looking at how the authors suggest improving that approach.

Emmy: They aren't just stopping there; they are suggesting a way to make the method even more robust by refining the conditions under which you get contractibility.

Kolya: So what does refinement mean here? Are they tightening up those local checks, or are they widening the scope of groups that this criterion applies to?

Ada: They’re focusing on making sure that when we check those finite subsets, we use tighter constraints on the distance and the length conditions. It’s about improving the numbers in their proof structure.

Emmy: Specifically, they introduce an idea where you can prove contractibility by looking at a slightly different structure of the descending links—a different way to look at how elements connect within that finite set.

Kolya: I mean, if you tighten the constraints, does that make the result more powerful? Does it mean we get contractibility for groups that were previously just on the edge of having it?

Ada: Yes, they are showing how a slight adjustment to the constraints allows them to prove contractibility under even weaker initial assumptions. It makes their sufficient condition work for a wider range of group structures.

Emmy: They’re essentially showing that their discrete Morse function setup is flexible enough that you can still control the topology even when the word length isn't perfectly constant across every single set.

Kolya: So, what’s the practical result of these improvements for someone applying this to a specific problem, like analyzing a particular group?

Ada: It means you don't have to be so worried about every single local condition being perfect; you can afford some flexibility in the measurements as long as you stick to the new refined criteria.

Emmy: It’s an engineering improvement for the theory—making the system more stable and less sensitive to minor variations in input data, which in this case is the group structure.

Kolya: Does this mean we can now apply this idea to those groups that were previously considered too messy or too complicated for the original method?

Ada: They are pushing toward a general criterion. The goal is to find a condition that works across more different types of finitely generated groups, not just right-angled Artin groups.

Emmy: And they’re opening the door for future work by laying out exactly where the current limitations are, so other researchers know what’s left to explore in this area.

Kolya: So it sounds like they’re moving from proving a specific result to building a more general tool that can be adapted.

Ada: That is the direction they are taking, establishing a systematic method that can be applied across different settings in geometric group theory.

Conclusion: Ada: So, to wrap up this discussion on "Word length, Morse theory, and Vietoris–Rips complexes," we’ve seen how discrete Morse theory provides a systematic way to probe the connectivity of these groups using word length as a measurement tool.

Emmy: It really shows how local geometric information about the group elements dictates the global topological shape of these complexes under certain algebraic constraints.

Kolya: I just want to say that while it works for specific cases like triangle-free right-angled Artin groups, the real value here is showing us a method for testing connectivity that scales with complexity.

Ada: Exactly. It gives us a checklist based on checking those specific finite sets, which is much more manageable than looking at everything at once when dealing with infinite groups.

Emmy: And the improvement they suggest means this tool can be made even more flexible, handling slightly messier group structures without losing the contractibility proof.

Kolya: So that’s a significant step toward making these geometric methods applicable to a broader class of groups, not just the ones with nice, highly structured relationships.

Ada: It is. The authors are aiming for that general criterion, showing that local information can govern global topology in a way we hadn't fully seen before.

Emmy: And by refining the Morse function setup and the link structures, they’re building a more stable framework for this kind of analysis.

Kolya: I think what sticks is how they connect these group-theoretic properties to actual topological connectivity, which is what makes it useful for applying ideas from other areas of mathematics.

Ada: It’s a solid piece of work that shows the power of discrete Morse theory when paired with metric measurements like word length.

Emmy: We should keep an eye on how these refinements get applied to more complex dynamical systems, since that’s where the next big structural challenge lies.

Seth Hulbert, Matthew C. B. Zaremsky

math.GR, math.MG

Submitted: 2026-08-26

Updated: 2026-11-18

Comments: 14 pages, 3 figures. V2: Minor changes, accepted version, to appear in Adv. Geom

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

The gist: We present a discrete Morse theoretic approach to proving high connectivity or contractibility of a Vietoris–Rips complex using distance to a fixed point as an initial measurement The single most…

Key concepts

Vietoris–Rips Complex (VRt(X))
This complex is built from a set X by considering all finite subsets S where the distance between any two points in S is less than or equal to a fixed radius t. It represents the geometric realization of these connected subsets, providing topological information about the underlying metric space.
Discrete Morse Theory
This is a mathematical tool used to simplify topological spaces by defining 'Morse functions' on them. The paper uses this theory to analyze the structure of VRt(G) by examining how certain functions change across different subsets, helping to prove properties like contractibility or connectivity.
Word Length (len(S))
The word length of a finite subset S is related to the shortest word required in the group G to represent elements within that subset. This metric is crucial for defining a specific Morse function used in the proof, helping to distinguish between different subsets and guide the topological analysis.
Right-Angled Artin Groups (RAAGs)
RAAGs are a class of groups defined by a graph where vertices represent group generators and edges represent commutation relations. The paper uses RAAGs as a concrete example to show that VRt(AΓ) can be shown to be contractible under specific conditions, such as when the underlying graph Γ is triangle-free.

Terminology

Summary

We present a discrete Morse theoretic approach to proving high connectivity or contractibility of a Vietoris–Rips complex using distance to a fixed point as an initial measurement The single most informative sentence about the paper's subject and finding is: We present a discrete Morse theoretic approach to proving high connectivity or contractibility of a Vietoris–Rips complex using distance to a fixed point as an initial measurement

Problem Statement and Criterion

The paper addresses the question of whether for which other groups does VRt(G) (t < ∞) have contractible, focusing on finitely generated groups with word metric coming from a finite generating set. The authors establish a general sufficient criterion for VRt(G) to be highly connected or contractible based on Bestvina–Brady discrete Morse theory. p. 0 This criterion is local, concerning finite subsets of G of a fixed diameter and specific length conditions. p. 0

Vietoris–Rips Complex Definition and Properties

The Vietoris–Rips complex VRt(X) is defined as the geometric realization Pt where Pt is the subposet of all non-empty finite subsets S of X with diam(S) ≤ t < ∞. A key property noted is that a finitely generated group G always admits a nice (i. p. 2e., proper cocompact) action on each VRt(G) by left translation. p. 2 Furthermore, Brown’s finiteness criterion implies that G is of type Fn if and only if (VRt(G))t is essentially (n −1)-connected, and type FPn if and only if (VRt(G))t is essentially (n −1)-acyclic. p. 2

Discrete Morse Theory Application

The authors set up a specific discrete Morse theory using a function f(S):= lenmin(S) + SN, which is shown to be a Morse function. The descending link of S, denoted Dt(S), is related to the complex structure through the formula lk↓(S) = lk∂↓(S) ∗ lkδ↓(S). p. 4 Lemma 3.3 shows that if len is not constant on S, then lk∂↓(S), hence lk↓(S), is contractible. p. 4

Results for Right-Angled Artin Groups

As a proof-of-concept, Theorem B proves that VR2(AΓ) is contractible for two-dimensional right-angled Artin groups with the standard word metric when Γ is triangle-free. The paper also provides sufficient conditions for a group to be finitely presented using connectivity checks of certain finite complexes. p. 0 Specific lemmas demonstrate that if Γ has no 3-cliques, then elements of S have a unique common descending neighbor when d(g, g') = 2 and len is constant on S. This leads to the conclusion that VRt(AΓ) is contractible for all t ≥ 2 if Γ is triangle-free. p. 1

Conclusion on Contractibility

Theorem B concludes that VRt(AΓ) is contractible for two-dimensional RAAGs when Γ is triangle-free. This result relies on Corollary 3. p. 04, which states that if lkδ↓(S) is contractible for all such S, then VRt(X) is contractible. p. 4 The paper also proves that if S ≥ 2 and len is constant on S, then lkδ↓(S) is contractible. p. 9 In particular, VRt(AΓ) is contractible for all t ≥ n where n is the maximum size of a clique in Γ. p. 1 The paper also proves that if G has no odd-length cycles and there exists some odd t such that Dt(g) is connected for all g! p. 1= 1, then G is finitely presented. p. 0 The overall goal is to establish a general sufficient criterion for VRt(G) to be highly connected or contractible. p. 0 The paper also proves that if Γ has no 3-cliques, then VRt(AΓ) is contractible. p. 9

References

[BB97] Mladen Bestvina and Noel Brady. Morse theory and finiteness properties of groups. p. 2 Invent. Math., 129(3):445–470, 1997

[BH99] Martin R. Bridson and Andr´e Haefliger. Metric spaces of non-positive curvature, volume 319 of Grundlehren der mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. p. 1 Springer-Verlag, Berlin, 1999

[Bro87] Kenneth S. Brown. Finiteness properties of groups. p. 2 In Proceedings of the Northwestern conference on cohomology of groups (Evanston, Ill. p. 0, 1985), volume 44, pages 45–75, 1987

[CCG+25] J´er´emie Chalopin, Victor Chepoi, Anthony Genevois, Hiroshi Hirai, and Damian Osajda. Helly groups. p. 0 Geom. Topol., 29(1):1–70, 2025

[Cha] Ruth Charney. An introduction to right-angled Artin groups. p. 1 arXiv:0610668

[Gen] Anthony Genevois. Why CAT(0) cube complexes should be replaced with median graphs. p. 6 arXiv:2309. p. 002070

[GSS] Raju Kumar Gupta, Sourav Sarkar, and Samir Shukla. On the Vietoris-Rips complexes of integer lattices. p. 2 arXiv:2511. p. 004238

[LS] Kevin Li and Luis Jorge S´anchez Salda˜na. Contractible Rips complexes of groups via metric gluings. p. 1 arXiv:2608. p. 024279

[Qui78] Daniel Quillen. Homotopy properties of the poset of nontrivial p-subgroups of a group. p. 0 Adv. in Math., 28(2):101–128, 1978

[Vie27] L. Vietoris. Uber den h¨oheren Zusammenhang kompakter R¨aume und eine Klasse von zusam- menhangstreuen Abbildungen. Math. Ann., 97(1):454–472, 1927

[Vir25] Ziga Virk. Contractibility of the Rips complexes of integer lattices via local domination. p. 2 Trans. Amer. Math. Soc., 378(3):1755–1770, 2025

[VZ21] Marco Varisco and Matthew C. B. Zaremsky. Equivariant Morse theory on Vietoris-Rips complexes and universal spaces for proper actions. p. 0 Bull. Lond. Math. Soc., 53(6):1724–1739, 2021

[Zar22] Matthew C. B. Zaremsky. Bestvina-Brady discrete Morse theory and Vietoris–Rips complexes. p. 2 Amer. J. Math., 144(5):1177–1200, 2022

[Zar26] Matthew C. B. Zaremsky. Contractible Vietoris-Rips complexes of Z n. p. 1 Proc. Amer. Math.

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. Discrete Morse theory application for group connectivity: The system can prove that for a finitely generated group G with word metric d, if Dt(S) is (n - S - 1)-connected for all non-empty finite S such that len is constant on S, then VRt(G) is (n - 1)-connected.

  2. Sufficient condition for finite presentability: The system can prove a sufficient condition for a group to be finitely presented by checking connectivity of certain finite complexes, specifically Theorem C in the paper.

  3. Contractibility proof for right-angled Artin groups: The system can prove that VR2(AΓ) is contractible if Γ is triangle-free, using the result derived from Lemma 4.10 and Corollary 3.4 applied to two-dimensional RAAGs.

  4. Unique common neighbor finding: The system can efficiently find a unique common descending neighbor for elements in a right-angled Artin group when they are at distance 2 and have the same word length, based on Lemma 4.6 and Observation 4.2.

  5. Detecting graph structure from group properties: The system can infer the existence of a 3-clique in a triangle-free RAAG if it finds that some element has more than two descending neighbors, as stated in Corollary 4.5 and Lemma 4.8.

Sources

Related papers