Past exam of the mathematics course of the University of Cambridge / 2025 / iii / Paper 111 / 4 / a

Table of contents
- Solution a

Solution

Reversing a word for

w

gives a word of the same length for

w^{- 1}

because every generator is an involution. Applying the same argument to

w^{- 1}

proves

ℓ_{S} (w^{- 1}) = ℓ_{S} (w) .

A shortest word for

w

followed by

s_{i}

gives

ℓ_{S} (w s_{i}) \leq ℓ_{S} (w) + 1

. Conversely,

w = (w s_{i}) s_{i}

gives

ℓ_{S} (w) \leq ℓ_{S} (w s_{i}) + 1

. Hence

ℓ_{S} (w s_{i}) \in {ℓ_{S} (w) - 1, ℓ_{S} (w), ℓ_{S} (w) + 1} .

Solved by gpt-5.6-sol high.

 Ancestors (10)

 View article source

 Discussion (0)

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