Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Bender-Knuth Involution

Numerical Algorithm

In algebraic combinatorics, a Bender-Knuth involution is an involution, a mapping that is its own inverse, defined on the set of semistandard tableaux. It was introduced by Bender and Knuth in the course of their study of plane partitions. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Sources
Wikipedia: Bender-Knuth involution
Lead section
Quote, Lead section
In algebraic combinatorics, a Bender-Knuth involution is an involution on the set of semistandard tableaux, introduced by Bender & Knuth (1972, pp. 46-47) in their study of plane partitions.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.