Abstract:
If an arbitrary Young diagram is given, then we can associate with it a group acting on the set of all Young tableaux of this form. It turns out that if the diagram consists of two rows, this group is always isomorphic to either a symmetric or an alternating group. In the paper this alternative is resolved in terms of the lengths of the two rows.
Key words and phrases:permutation groups, graded graphs, Young diagrams and Young tableaux, involutions.