English

The local dimension of suborders of the Boolean lattice

Combinatorics 2020-05-05 v2

Abstract

We prove upper and lower bounds on the local dimension of any pair of layers of the Boolean lattice, and show that the local dimension of the first and middle layers of the nn-dimensional Boolean lattice is asymptotically nlog2n\frac{n}{\log_2 n} as nn\to\infty. Previously, all that was known was a lower bound of Ω(n/logn)\Omega(n/\log n) and an upper bound of nn. Improving a result of Kim, Martin, Masa\v{r}\'{i}k, Shull, Smith, Uzzell, and Wang, we also prove that that the maximum local dimension of an nn-element poset is at least (14o(1))nlog2n\left(\frac{1}{4}-o(1)\right)\frac{n}{\log_2 n}.

Keywords

Cite

@article{arxiv.2001.08628,
  title  = {The local dimension of suborders of the Boolean lattice},
  author = {David Lewis},
  journal= {arXiv preprint arXiv:2001.08628},
  year   = {2020}
}

Comments

13 pages