Viennot's Geometric Construction
   HOME

TheInfoList



OR:

In mathematics, Viennot's geometric construction (named after
Xavier Gérard Viennot Xavier or Xabier may refer to: Place * Xavier, Spain People * Xavier (surname) * Xavier (given name) * Francis Xavier (1506–1552), Catholic saint ** St. Francis Xavier (disambiguation) * St. Xavier (disambiguation) * Xavier (footballer, born J ...
) gives a diagrammatic interpretation of the
Robinson–Schensted correspondence In mathematics, the Robinson–Schensted correspondence is a bijective correspondence between permutations and pairs of standard Young tableaux of the same shape. It has various descriptions, all of which are of algorithmic nature, it has many remar ...
in terms of shadow lines. It has a generalization to the
Robinson–Schensted–Knuth correspondence In mathematics, the Robinson–Schensted–Knuth correspondence, also referred to as the RSK correspondence or RSK algorithm, is a combinatorial bijection between matrices with non-negative integer entries and pairs of semistandard Young tableaux ...
, which is known as the matrix-ball construction.


The construction

Starting with a
permutation In mathematics, a permutation of a set can mean one of two different things: * an arrangement of its members in a sequence or linear order, or * the act or process of changing the linear order of an ordered set. An example of the first mean ...
\sigma \in S_n , written in
two-line notation In mathematics, a permutation of a set can mean one of two different things: * an arrangement of its members in a sequence or linear order, or * the act or process of changing the linear order of an ordered set. An example of the first meanin ...
, say: : \sigma = \begin 1 & 2 & \cdots & n \\ \sigma_1 & \sigma_2 & \cdots & \sigma_n \end, one can apply the Robinson–Schensted correspondence to this permutation, yielding two standard Young tableaux of the same shape, ''P'' and ''Q''. ''P'' is obtained by performing a sequence of insertions, and ''Q'' is the recording tableau, indicating in which order the boxes were filled. Viennot's construction starts by plotting the points (i, \sigma_i) in the plane, and imagining there is a light that shines from the origin, casting shadows straight up and to the right. This allows consideration of the points which are not shadowed by any other point; the boundary of their shadows then forms the first shadow line. Removing these points and repeating the procedure, one obtains all the shadow lines for this permutation. Viennot's insight is then that these shadow lines read off the first rows of ''P'' and ''Q'' (in fact, even more than that; these shadow lines form a "timeline", indicating which elements formed the first rows of ''P'' and ''Q'' after the successive insertions). One can then repeat the construction, using as new points the previous unlabelled corners, which allows to read off the other rows of ''P'' and ''Q''.


Animation

For example consider the permutation : \sigma = \begin 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 \\ 3 & 8 & 1 & 2 & 4 & 7 & 5 & 6 \end. Then Viennot's construction goes as follows:


Applications

One can use Viennot's geometric construction to prove that if \sigma corresponds to the pair of tableaux ''P'',''Q'' under the Robinson–Schensted correspondence, then \sigma^ corresponds to the switched pair ''Q'',''P''. Indeed, taking \sigma to \sigma^{-1} reflects Viennot's construction in the y=x-axis, and this precisely switches the roles of ''P'' and ''Q''.


See also

*
Plactic monoid In mathematics, the plactic monoid is the monoid of all words in the alphabet of positive integers modulo Knuth equivalence. Its elements can be identified with semistandard Young tableaux. It was discovered by (who called it the tableau alg ...
*
Jeu de taquin In the mathematical field of combinatorics, jeu de taquin is a construction due to which defines an equivalence relation on the set of skew standard Young tableaux. A jeu de taquin slide is a transformation where the numbers in a tableau are move ...


References

* Bruce E. Sagan. ''The Symmetric Group''. Springer, 2001. Algebraic combinatorics