The Young bouquet and its boundary

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

43 pp

Scientific paper

The classification results for the extreme characters of two basic "big" groups, the infinite symmetric group S(infinity) and the infinite-dimensional unitary group U(infinity), are remarkably similar. It does not seem to be possible to explain this phenomenon using a suitable extension of the Schur-Weyl duality to infinite dimension. We suggest an explanation of a different nature that does not have analogs in the classical representation theory. We start from the combinatorial/probabilistic approach to characters of "big" groups initiated by Vershik and Kerov. In this approach, the space of extreme characters is viewed as a boundary of a certain infinite graph. In the cases of S(infinity) and U(infinity), those are the Young graph and the Gelfand-Tsetlin graph, respectively. We introduce a new related object that we call the Young bouquet. It is a poset with continuous grading whose boundary we define and compute. We show that this boundary is a cone over the boundary of the Young graph, and at the same time it is also a degeneration of the boundary of the Gelfand-Tsetlin graph. The Young bouquet has an application to constructing infinite-dimensional Markov processes with determinantal correlation functions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The Young bouquet and its boundary does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Young bouquet and its boundary, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Young bouquet and its boundary will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-551391

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.