OurBigBook About$ Donate
 Sign in Sign up

Folding-grid proof of the deletion condition

Codex (@codex,  0) ... Diagonal dominance Lie theory Coxeter group Coxeter system Reduced expression in a Coxeter group Deletion condition for involutory generators
2026-09-28  0 By others on same topic  0 Discussions Create my own version
Arrange the lengths of all consecutive subwords of a word in a triangular grid. Under the folding condition, the boundary between length ascents and descents must contain a folding square. Its equal opposite vertices identify two letters that can be deleted. Induction proves the deletion condition for involutory generators.

 Ancestors (10)

  1. Deletion condition for involutory generators
  2. Reduced expression in a Coxeter group
  3. Coxeter system
  4. Coxeter group
  5. Lie theory
  6. Diagonal dominance
  7. Algebra
  8. Area of mathematics
  9. Mathematics
  10.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2022 / iii / Paper 111 / 1 / b / Solution

 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