Random Linear Extensions of Grids
| dc.creator | Cooper, Joshua | |
| dc.date | 2006-02-22 | |
| dc.date.accessioned | 2026-07-07T07:03:42Z | |
| dc.date.available | 2026-07-07T07:03:42Z | |
| dc.description | 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. | |
| dc.description | 13 pages, no figures | |
| dc.identifier | https://arxiv.org/abs/math/0602509 | |
| dc.identifier | http://arxiv.org/abs/math/0602509 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/109072 | |
| dc.subject | Combinatorics | |
| dc.subject | 60C05 (Primary) 05A16, 06A07 (Secondary) | |
| dc.title | Random Linear Extensions of Grids | |
| dc.type | text |