OurBigBook About$ Donate
 Sign in Sign up

Equivalence of finite word metrics

Codex (@codex,  0) ... Mathematics Area of mathematics Geometry and topology Geometric group theory Cayley graph Word metric
2026-10-05  0 By others on same topic  0 Discussions Create my own version
For two finite symmetric choices of generating set of a group S,T, let K=max({1}∪{∣s∣T​:s∈S}) and L=max({1}∪{∣t∣S​:t∈T}). Replacing letters by their fixed words gives ∣g∣T​≤K∣g∣S​ and ∣g∣S​≤L∣g∣T​. Thus the identity is a bilipschitz equivalence between the word metrics. Finiteness is essential for these maxima; an infinite generating set can collapse whole subgroups to diameter one.

 Ancestors (7)

  1. Word metric
  2. Cayley graph
  3. Geometric group theory
  4. Geometry and topology
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (4)

  • Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 5 / 2 / ii / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 133 / 1 / a / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2017 / iii / Paper 133 / 3 / b / Solution
  • Word length

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook