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

Kento Nakada (1, 2)

1 WAKHOK - Wakkanai Hokusei Gakuen University
2 Okayama University

\textbfAbstract. 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. ≠wline

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.

Mots clés: d-complete posets; algorithm; linear extension; uniform generation

Domaines: Mathématique discrète [cs.DM]

Kento Nakada. An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability. 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), 2012, Nagoya, Japan. pp.655-660, ⟨10.46298/dmtcs.3071⟩. ⟨hal-01283096⟩