Dyer groups have the falsification by fellow-traveller property
summary
The gist
Dyer groups have been shown to possess the falsification by fellow-traveller property with respect to a specific generating set…
In short
The paper investigates Dyer groups, which unify Coxeter groups and graph products of cyclic groups. It shows that a specific finite generating set (XS) exists for every Dyer group such that it satisfies the Falsification by Fellow-Traveller Property (FFTP). This property implies the group has finitely many cone types, meaning every Dyer group forms a Cannon pair with respect to this set.
Key concepts
- Dyer Groups
- These are groups formed by vertex- and/or edge-labelled graphs. They serve as a unifying structure for studying Coxeter groups and graph products of cyclic groups, possessing properties like rational growth series and a common solution to the word problem.
- Falsification by Fellow-Traveller Property (FFTP)
- This property relates to whether a group has a regular language of geodesics. Satisfying FFTP is much stronger than having finitely many cone types and implies that the group has only finitely many cone types with respect to a suitable generating set.
- Cone Types
- Introduced by Cannon, cone types represent the set of elements that extend a given geodesic path indefinitely. Having finitely many cone types means the group has a finite structure related to its geometric properties.
Terminology used across episodes
This episode discusses
- Dyer groups have the falsification by fellow-traveller property · Paper Radio
- Conjugacy geodesics and growth in dihedral Artin groups
- Rotation groups, mediangle graphs, and periagroups: a unified point of view on Coxeter groups and graph products of groups
The paper
Dyer groups have the falsification by fellow-traveller property · Read on arXiv
University of Geneva
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: "Dyer groups have the falsification by fellow-traveller property".
Emmy: Here's the gist of the paper. Dyer groups have been shown to possess the falsification by fellow-traveller property with respect to a specific generating set, which implies that they form a Cannon pair and have finitely many cone types The main result of this paper is that every Dyer group admits a finite generating set with respect to which it satisfies the FFTP (Theorem 3.2) and hence, forms a Cannon pair (Corollary 3.9).
Ada: Introduction to Dyer Groups and Related Concepts Dyer groups form a class of groups that unify the study of Coxeter groups and graph products of cyclic groups, defined by vertex- and/or edge-labelled graphs They are instances of periagroups
16, 17: and share fundamental properties such as the rationality of their growth series
30: and a common solution to the word problem
29: .
Emmy: The notion of cone types is introduced by Cannon in the 80s, where it corresponds to the set of elements which extend it geodesically.
Ada: The Falsification by Fellow-Traveller Property (FFTP) The falsification by fellow-traveller property (FFTP) was initially introduced in the 90s to approach the problem of determining which pairs of groups together with a finite generating set admit a regular language of geodesics.
Paper summary: Ada: We just touched on how this paper shows Dyer groups have a finite generating set where they satisfy the falsification by fellow-traveller property >
Emmy: It's important to remember what this property actually means in the context of group theory. It’s about whether there is a regular language of geodesics on the Cayley graph, and this property is strictly stronger than just having some kind of regularity >
Kolya: So, if they prove that Dyer groups have this FFTP with respect to a generating set X S, what does that actually tell us about the group's growth or its geometry? Is it just a technicality, or does it constrain the shape of the group structure itself >
Ada: It constrains it. Because as we saw, this property implies that Dyer groups have finitely many cone types >
Emmy: Which is a big deal because cone types relate to how elements extend geodesically in the Cayley graph, and having finitely many of them gives us a very controlled geometric structure >
Kolya: So for someone interested in the probabilistic side, what does that mean about random walks on these groups? Does having finite cone types put an upper bound on the spectral radius of those walks >
Ada: The paper mentions computing the spectral radius of the simple random walk on its Cayley graph eighteen twenty-two twenty-four twenty-five, and this property is used in that context > <ref:2602.18220#pg2,the spectral radius of the simple random walk on its Cayley graph>
Emmy: It suggests that for these groups, the upper and lower estimates for the spectral radius of those random walks are more tightly controlled than we might expect from just looking at their general growth series nineteen twenty-two > <ref:2602.18220#pg2,upper and lower estimates for the spectral radius of>
Kolya: So what's the catch here? The paper constructs this specific set X S by modifying a standard generating set and interpolating between it and these so-called syllables; how does that modification affect the resulting bounds on the spectral radius >
Ada: Well, they include elements like x alpha v where f(v) is finite, along with x, plus one minus one v where the function of v is infinite >
Conclusion: Ada: So to wrap up, this paper by Megan Howarth is showing that Dyer groups, despite their complexity arising from being graph products of cyclic groups and Coxeter systems, still have a very nice geometric structure when you choose the right generating set >
Emmy: The main point is that finding this specific finite generating set makes the group behave much more nicely geometrically because it guarantees finitely many cone types >
Kolya: So for someone listening who doesn't know much about group theory, what does this mean practically? It just means that if you are studying a Dyer group, you can use tools from geometric group theory with a finite set of building blocks instead of dealing with the full complexity of the infinite presentation directly >
Ada: Exactly. It gives us a concrete way to study them that has strong geometric guarantees, and it connects this whole class of groups back to well-studied examples like Coxeter groups >
Emmy: The paper is important because it provides a specific framework—the falsification by fellow-traveller property—that lets us connect the abstract algebraic definition of these groups to concrete, quantifiable geometric properties >
More episodes
- 2508.18266-On models of affine arithmetic
- 2508.20749-Rates of convergence for extremal spacings in Kakutani's random interval-splitting process
- 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