### Abstract

Let P = (X, <) be a finite ordered set and let |P| denote the cardinality of the universe X. Also let Δ(P) denote the maximum degree of P, i.e., the maximum number of points comparable to any one point of P. Füredi and Kahn used probabilistic methods to show that the dimension of P satisfies dim(P)≦ c_{1} Δ(P)log|P| and dim(P) ≦ c_{2}ΔP log^{2}Δ(P) where c, and c_{2} are positive absolute constants. In this article, we consider the probability space Ω(n, p) of bipartite ordered sets having n minimal elements and n maximal elements, where the events that any minimal element is less than any maximal element are independently distributed and each has probabilityp =p(n). We show that for every ϵ >0, there exist δ, c > 0 so that: (1) if (log^{1+ϵ}n)/n<p < 1/log n, then dim(P)∈ Ωpn log pn for almost all P∈ Δ(n, p); and (2) if 1/log n ≦ < 1 − n^{−1+ϵ}, then dim(P) >n‐ cnlp log n for almost all P ∈Ω(n, p). The first inequality is best possible up to the value of the constant δ when p > (log^{2+e}n)/n. As to the accuracy of the second inequality, we have the trivial upper bound dim(P)≦n for all P∈Ω(n, p). We then develop a nontrivial upper bound which holds for almost all P ∈Ω(n, p), when p ≧ 1 /log n. This upper bound has the same form as the lower bound when p is constant. We also study the space ℒ(n) of all labelled ordered sets on n points and show that there exist positive constants c_{1}, c_{2} so that n/4 ‐ c_{1}n/log n < dim(P) <c_{2} n/4 ‐ c_{2}n/log n for almost all P ∈ ℒ(n).

Original language | English |
---|---|

Pages (from-to) | 253-275 |

Number of pages | 23 |

Journal | Random Structures & Algorithms |

Volume | 2 |

Issue number | 3 |

DOIs | |

Publication status | Published - 1991 |

### ASJC Scopus subject areas

- Software
- Mathematics(all)
- Computer Graphics and Computer-Aided Design
- Applied Mathematics

## Fingerprint Dive into the research topics of 'The dimension of random ordered sets'. Together they form a unique fingerprint.

## Cite this

*Random Structures & Algorithms*,

*2*(3), 253-275. https://doi.org/10.1002/rsa.3240020302