Combinatorial Algorithms for Binary Operations on LR-tableaux with Entries Equal to 1 with Applications to Nilpotent Linear Operators

In the paper we investigate an algorithmic associative binary operation * on the set ℒℛ₁ of Littlewood-Richardson tableaux with entries equal to one. We extend * to an algorithmic nonassociative binary operation on the set ℒℛ₁ × ℕ and show that it is equivalent to the operation of taking the generic extensions of objects in the category of homomorphisms from semisimple nilpotent linear operators to nilpotent linear operators. Thus we get a combinatorial algorithm computing generic extensions in this category.