Local dimension of a Boolean lattice
J\k{e}drzej Hodor, Jakub Sordyl

TL;DR
This paper proves that the local dimension of the Boolean lattice of all subsets of an n-element set is less than n for all n ≥ 4, resolving a previously posed question and exploring related problems.
Contribution
It establishes a new upper bound on the local dimension of Boolean lattices, answering a specific open question in poset theory.
Findings
The local dimension of the Boolean lattice is strictly less than n for all n ≥ 4.
The paper provides bounds and properties related to the local dimension of Boolean lattices.
It explores related problems in the structure of posets and their dimensions.
Abstract
For every integer with , we prove that the local dimension of a poset consisting of all the subsets of equipped with the inclusion relation is strictly less than , answering a question of Kim, Martin, Masa\v{r}\'ik, Shull, Smith, Uzzell, and Wang (Eur. J. Comb. 2020). We also study several related problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Coding theory and cryptography · Advanced Topology and Set Theory
