Skip to Main content Skip to Navigation
Conference papers

An algorithm which generates linear extensions for a generalized Young diagram with uniform probability

Abstract : 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. \par
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-01186271
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, August 24, 2015 - 3:46:37 PM
Last modification on : Tuesday, March 7, 2017 - 3:10:01 PM
Long-term archiving on: : Wednesday, November 25, 2015 - 5:21:56 PM

File

dmAN0170.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01186271, version 1

Collections

Citation

Kento Nakada, Shuji Okamura. An algorithm which generates linear extensions for a generalized Young diagram with uniform probability. 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), 2010, San Francisco, United States. pp.933-940. ⟨hal-01186271⟩

Share

Metrics

Record views

74

Files downloads

515