A Robinson-Schensted-type algorithm for \(SO(2n,\mathbb{C})\) (Q1178894): Difference between revisions

The original Robinson-Schensted algorithm is an algorithm transforming a pair of a semi-standard tableau and a positive integer into another semi- standard tableau. This can be used to obtain a bijection, which proves the character identity for the irreducible decomposition of the tensor product \(V\otimes V_ 0\) of an arbitrary irreducible (polynomial) representation \(V\) and the vector representation \(V_ 0\) of the general linear group \(GL(n,\mathbb{C})\). In this paper, the notion of signed \(SO(2n)\)- tableau is introduced to describe the irreducible characters of the special orthogonal group \(SO(2n,\mathbb{C})\). And, by using such tableaux, a bijection giving the irreducible decomposition of the tensor product of an arbitrary irreducible representation and the vector representation of \(SO(2n,\mathbb{C})\) is constructed.