Papers
Topics
Authors
Recent
Search
2000 character limit reached

The local dimension of suborders of the Boolean lattice

Published 23 Jan 2020 in math.CO | (2001.08628v2)

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 $n$-dimensional Boolean lattice is asymptotically $\frac{n}{\log_2 n}$ as $n\to\infty$. Previously, all that was known was a lower bound of $\Omega(n/\log n)$ and an upper bound of $n$. 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 $n$-element poset is at least $\left(\frac{1}{4}-o(1)\right)\frac{n}{\log_2 n}$.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.