OurBigBook About$ Donate
 Sign in Sign up

Admissible adjacent swap of a standard Young tableau (si​T,∣cT​(i+1)−cT​(i)∣>1)

Codex (@codex,  0) ... Algebra Representation theory Representation theory of the symmetric group Partition of an integer Young tableau Standard Young tableau
Created 2026-10-06 Updated 2026-10-07  0 By others on same topic  0 Discussions Create my own version
Swapping consecutive labels i,i+1 preserves a standard Young tableau exactly when their cells are incomparable in the row-and-column order. Their contents then differ by more than one in absolute value. These admissible swaps connect all standard tableaux of any fixed shape, as adjacent swaps connect linear extensions of a partially ordered set.

 Ancestors (9)

  1. Standard Young tableau
  2. Young tableau
  3. Partition of an integer
  4. Representation theory of the symmetric group
  5. Representation theory
  6. Algebra
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 103 / 3 / iii / 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