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

Kento Nakada, Shuji Okamura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationFPSAC'10 - 22nd International Conference on Formal Power Series and Algebraic Combinatorics
Pages933-940
Number of pages8
Publication statusPublished - 2010
Externally publishedYes
Event22nd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'10 - San Francisco, CA, United States
Duration: Aug 2 2010Aug 6 2010

Other

Other22nd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'10
CountryUnited States
CitySan Francisco, CA
Period8/2/108/6/10

Fingerprint

Young Diagram
Linear Extension
Decompose

Keywords

  • Algorithm
  • Generalized Young diagrams
  • Kac-Moody Lie algebra
  • Linear extension

ASJC Scopus subject areas

  • Algebra and Number Theory

Cite this

Nakada, K., & Okamura, S. (2010). An algorithm which generates linear extensions for a generalized Young diagram with uniform probability. In FPSAC'10 - 22nd International Conference on Formal Power Series and Algebraic Combinatorics (pp. 933-940)

An algorithm which generates linear extensions for a generalized Young diagram with uniform probability. / Nakada, Kento; Okamura, Shuji.

FPSAC'10 - 22nd International Conference on Formal Power Series and Algebraic Combinatorics. 2010. p. 933-940.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nakada, K & Okamura, S 2010, An algorithm which generates linear extensions for a generalized Young diagram with uniform probability. in FPSAC'10 - 22nd International Conference on Formal Power Series and Algebraic Combinatorics. pp. 933-940, 22nd International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'10, San Francisco, CA, United States, 8/2/10.
Nakada K, Okamura S. An algorithm which generates linear extensions for a generalized Young diagram with uniform probability. In FPSAC'10 - 22nd International Conference on Formal Power Series and Algebraic Combinatorics. 2010. p. 933-940
Nakada, Kento ; Okamura, Shuji. / An algorithm which generates linear extensions for a generalized Young diagram with uniform probability. FPSAC'10 - 22nd International Conference on Formal Power Series and Algebraic Combinatorics. 2010. pp. 933-940
@inproceedings{8123f6c438354ee28932dc09a49896bb,
title = "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.",
keywords = "Algorithm, Generalized Young diagrams, Kac-Moody Lie algebra, Linear extension",
author = "Kento Nakada and Shuji Okamura",
year = "2010",
language = "English",
pages = "933--940",
booktitle = "FPSAC'10 - 22nd International Conference on Formal Power Series and Algebraic Combinatorics",

}

TY - GEN

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

AU - Nakada, Kento

AU - Okamura, Shuji

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Algorithm

KW - Generalized Young diagrams

KW - Kac-Moody Lie algebra

KW - Linear extension

UR - http://www.scopus.com/inward/record.url?scp=84860505027&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84860505027&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84860505027

SP - 933

EP - 940

BT - FPSAC'10 - 22nd International Conference on Formal Power Series and Algebraic Combinatorics

ER -