[Paper Review] Arrays and the octahedron recurrence

В. И. Данилов, Gleb Koshevoy|ArXiv.org|Apr 14, 2005

Advanced Combinatorial Mathematics4 references6 citations

TL;DR

This paper establishes a combinatorial foundation for the octahedron recurrence (OR) using arrays, demonstrating that OR preserves discrete concavity and induces natural bijections equivalent to those in RSK correspondence and jeu de taquin. It proves that the associativity and commutativity bijections arising from array theory coincide with those defined via OR and Young tableaux, unifying discrete concave functions, arrays, and symmetric function theory through a functional form of RSK.

ABSTRACT

Recently, in papers by Knutson, Tao and Woodward, Henriques and Kamnitzer, Pak and Vallejo have been constructed several interesting bijections of associativity and commutativity. In the first two papers bijections relate special sets of discretely concave functions (hives) on triangular grids and the octahedron recurrence plays the key role for these bijections. Pak and Vallejo related special sets of Young tableaux and constructions of these bijections based on standard algorithms in this theory, jeu de taquen, Schutzenberger involution, tableaux switching, etc. In this paper we investigate these constructions from the third point of view, combinatorics of arrays, theory worked out recently by the authors. Arrays naturally related as well to functions on the lattice of integers as to Young tableaux. In the tensor category of arrays, the bijections of associativity and commutativity arise naturally. We establish coincidence of our bijections with that defined in the first two papers and in the integer-valued set-up with the bijection in the third paper (that is, in particular, a solution of Conjecture 1 by Pak and Vallejo). In order to relate different approaches and to reveal combinatorics of the octahedron recurrence, we, first, show that the octahedron recurrence agrees with discrete convexity and, second, we construct another bijection using the octahedron recurrence, the functional form of the RSK correspondence.

Motivation & Objective

• To clarify the combinatorial rationale behind the octahedron recurrence (OR) as a source of natural bijections in discrete concave function theory.
• To establish a functional form of the RSK correspondence via the OR and array condensation operations.
• To prove that the associativity and commutativity bijections derived from array theory coincide with those constructed via the OR and Young tableaux in prior works.
• To unify discrete concave functions, arrays, and symmetric function theory through the lens of the octahedron recurrence.

Proposed method

• The paper introduces arrays as a combinatorial framework unifying integer-valued functions on lattices and Young tableaux, with D-tight arrays corresponding to standard Young tableaux.
• It defines the octahedron recurrence as a propagation rule: f(1) = max(f(a)+f(a'), f(b)+f(b')) - f(0), which preserves discrete concavity.
• The authors prove that the OR preserves discrete concavity (Theorem 1), showing that concave functions propagate consistently across the lattice.
• They define array condensation as a key operation, linking it to the OR and establishing a functional form of the RSK correspondence (Theorem 2).
• The paper constructs associativity and commutativity bijections in the array category and proves their equivalence to those in [oct, h-k, PV] (Theorem 3 and 4).
• It uses geometric and algebraic techniques, including modular and non-modular flats in Z³, to analyze propagation on grids and prisms.

Experimental results

Research questions

• RQ1 How does the octahedron recurrence preserve discrete concavity in functions defined on triangular and grid-like lattices?
• RQ2 Can the octahedron recurrence be interpreted as a natural mechanism for generating bijections in combinatorics, particularly in relation to the RSK correspondence?
• RQ3 Do the associativity and commutativity bijections arising from array theory coincide with those constructed via the OR and Young tableaux in prior works?
• RQ4 What is the functional form of the RSK correspondence in terms of array condensation and the octahedron recurrence?

Key findings

• The octahedron recurrence preserves discrete concavity: if input functions are discrete concave, the output function remains concave (Theorem 1).
• The operation of array condensation is shown to be equivalent to the octahedron recurrence, providing a functional form of the RSK correspondence (Theorem 2).
• The associativity bijection in the array category coincides exactly with the associativity bijection defined via the octahedron recurrence (Theorem 3).
• The commutativity bijection derived from arrays matches both the functional commutativity in [h-k] and the two fundamental symmetries in [PV], confirming their equivalence (Theorem 4).
• The paper establishes that arrays provide a unifying framework where discrete concave functions, Young tableaux, and the OR all cohere through natural categorical bijections.