An algorithm which generates linear extensions for a non-simply-laced d-complete poset with uniform probability - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2012

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

Abstract

\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.
Fichier principal
Vignette du fichier
dmAR0158.pdf (318.58 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01283096 , version 1 (05-03-2016)

Identifiers

Cite

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⟩

Collections

TDS-MACS
19 View
425 Download

Altmetric

Share

Gmail Facebook X LinkedIn More