Sciweavers

COMBINATORICS
2006
115views more  COMBINATORICS 2006»
13 years 11 months ago
Chains, Subwords, and Fillings: Strong Equivalence of Three Definitions of the Bruhat Order
Let Sn be the group of permutations of [n] = {1, . . . , n}. The Bruhat order on Sn is a partial order relation, for which there are several equivalent definitions. Three well-kno...
Catalin Zara
SODA
1997
ACM
76views Algorithms» more  SODA 1997»
14 years 24 days ago
Markov Chains for Linear Extensions, the Two-Dimensional Case
We study the generation of uniformly distributed linear extensions using Markov chains. In particular we show that monotone coupling from the past can be applied in the case of lin...
Stefan Felsner, Lorenz Wernisch