• Corpus ID: 237304023

A note on the Sundaram--Stanley bijection (or, Viennot for up-down tableaux)

@inproceedings{Bodish2021ANO,
  title={A note on the Sundaram--Stanley bijection (or, Viennot for up-down tableaux)},
  author={Elijah Bodish and Ben Elias and David E. V. Rose and Logan C. Tatham},
  year={2021}
}
We give a direct proof of a result of Sundaram and Stanley: that the dimension of the space of invariant vectors in a 2k-fold tensor product of the vector representation of sp2n equals the number of (n+1)-avoiding matchings of 2k points. This can be viewed as an extension of Schensted’s theorem on longest decreasing subsequences. Our main tool is an extension of Viennot’s geometric construction to the setting of up-down tableaux. 

References

SHOWING 1-10 OF 10 REFERENCES
Combinatorics of symplectic invariant tensors
An important problem from invariant theory is to describe the subspace of a tensor power of a representation invariant under the action of the group. According to Weyl's classic, the first main
Braids, link polynomials and a new algebra
A class function on the braid group is derived from the Kauffman link invariant. This function is used to construct representations of the braid groups depending on 2 parameters. The decomposition of
Spiders for rank 2 Lie algebras
A spider is an axiomatization of the representation theory of a group, quantum group, Lie algebra, or other group or group-like object. It is also known as a spherical category, or a strict, monoidal
Increasing and decreasing subsequences and their variants
We survey the theory of increasing and decreasing subsequences of permutations. Enumeration problems in this area are closely related to the RSK algorithm. The asymptotic behavior of the expected
Longest Increasing and Decreasing Subsequences
This paper deals with finite sequences of integers. Typical of the problems we shall treat is the determination of the number of sequences of length n, consisting of the integers 1,2, ... , m, which
Crossings and nestings of matchings and partitions
We present results on the enumeration of crossings and nestings for matchings and set partitions. Using a bijection between partitions and vacillating tableaux, we show that if we fix the sets of
The Kauffman Polynomial of Links and Representation Theory
On the combinatorics of representations of Sp(2n,C)
Une forme geometrique de la correspondance de Robinson-Schensted
Combinatorics of Coxeter Groups, volume 231 of Graduate Texts in Mathematics
  • 2005