Involutory lr symmetry bijection on hives

Littlewood–Richardson (LR) coefficients cμν may be evaluated by means of several combinatorial models. These include not only the original one based on the LR rule for enumerating LR tableaux of skew shape λ/μ and weight ν, but also one based on the enumeration of LR hives with boundary edge labels λ, μ and ν. Unfortunately, neither of these reveal in any obvious way the well-known symmetry property cμν = cνμ. Here we introduce a map σ(n) on LR hives that interchanges contributions to cμν and cνμ for any partitions λ, μ, ν of lengths no greater than n, and then prove that it is a bijection, thereby making manifest the required symmetry property. The map σ(n) involves repeated path removals from a given LR hive with boundary edge labels (λ, μ, ν) that give rise to a sequence of hives whose left-hand boundary edge labels define a partner LR hive with boundary edge labels (λ, ν, μ). A new feature of our hive model is its realisation in terms of edge labels and rhombus gradients, with the latter playing a key role in defining the action of path removal operators in a manner designed to preserve the required hive conditions. A consideration of the detailed properties of the path removal procedures also leads to a wholly combinatorial self-contained hive-based proof that σ(n) is an involution. Math. Subject Classification (2000): 05A19 05E05 15E10.