Random Linear Extensions of Grids
From MaRDI portal
Publication:6476759
arXivmath/0602509MaRDI QIDQ6476759FDOQ6476759
Authors: Joshua Cooper 
Publication date: 22 February 2006
Abstract: A grid poset -- or grid for short -- is a product of chains. We ask, what does a random linear extension of a grid look like? In particular, we show that the average "jump number," i.e., the number of times that two consecutive elements in a linear extension are incomparable in the poset, is close to its maximum possible value. The techniques employed rely on entropy arguments. We finish with several interesting questions about this wide-open area.
Combinatorial probability (60C05) Asymptotic enumeration (05A16) Combinatorics of partially ordered sets (06A07)
This page was built for publication: Random Linear Extensions of Grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6476759)
