Generating random elements of finite distributive lattices

zbMath0885.05018arXivmath/9801066MaRDI QIDQ1378529

James Propp

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

File on IPFS

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Designs and configurations (05B99)

Related Items (12)

Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings ⋮ Orientation-Constrained Rectangular Layouts ⋮ Tilings of rectangles with T-tetrominoes ⋮ \(q\)-distributions on boxed plane partitions ⋮ A refinement of weak order intervals into distributive lattices ⋮ A characterization of flip-accessibility for rhombus tilings of the whole plane ⋮ Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices ⋮ Generalized loop‐erased random walks and approximate reachability ⋮ Rotor Walks on Transient Graphs and the Wired Spanning Forest ⋮ Mixing Times of Markov Chains of 2-Orientations ⋮ Shuffling algorithm for boxed plane partitions ⋮ Another involution principle-free bijective proof of Stanley's hook-content formula

This page was built for publication: Generating random elements of finite distributive lattices