Shuji OKAMURA

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The purpose of this paper is to present an algorithm which generates linear extensions for a generalized Young diagram, in the sense of D. Peterson and R. A. Proctor, with uniform probability. This gives a proof of a D. Peterson’s hook formula for the number of reduced decompositions of a given minuscule elements. Résumé. Le but de ce papier est présenter(More)
  • 1