DMTCS Proceedings, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)

Font Size:  Small  Medium  Large

An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability

Kento Nakada

Abstract


The purpose of this paper is to present an algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability.
Résumé. Le but de ce papier est présenter un algorithme qui produit des extensions linéaires pour une non-simply-laced d-complete poset avec probabilité constante.

Full Text: PostScript PDF

Valid XHTML 1.0 Transitional