Generating random elements of finite distributive lattices
From MaRDI portal
Publication:1378529
zbMath0885.05018arXivmath/9801066MaRDI QIDQ1378529
Publication date: 15 February 1998
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9801066
Related Items
Rotor Walks on Transient Graphs and the Wired Spanning Forest, Generalized loop‐erased random walks and approximate reachability, Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings, Tilings of rectangles with T-tetrominoes, \(q\)-distributions on boxed plane partitions, A characterization of flip-accessibility for rhombus tilings of the whole plane, Shuffling algorithm for boxed plane partitions, Another involution principle-free bijective proof of Stanley's hook-content formula, A refinement of weak order intervals into distributive lattices, Mixing Times of Markov Chains of 2-Orientations, Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices, Orientation-Constrained Rectangular Layouts