Comparing Dushnik-Miller Dimension, Boolean Dimension and Local Dimension
Fidel Barrera-Cruz, Thomas Prag, Heather Smith, Libby Taylor, William, T. Trotter

TL;DR
This paper compares Dushnik-Miller, Boolean, and local dimensions of posets, revealing their relationships and bounds with respect to graph parameters like tree-width and path-width, using combinatorial and Ramsey theoretic methods.
Contribution
It establishes bounds and contrasts among the three dimension parameters, especially highlighting the limitations of local dimension in terms of tree-width.
Findings
Boolean dimension is bounded by tree-width, independent of height.
Local dimension cannot be bounded solely by tree-width, but is bounded by path-width.
Ramsey theoretic methods are used to derive several results.
Abstract
The original notion of dimension for posets is due to Dushnik and Miller and has been studied extensively in the literature. Quite recently, there has been considerable interest in two variations of dimension known as Boolean dimension and local dimension. For a poset , the Boolean dimension of and the local dimension of are both bounded from above by the dimension of and can be considerably less. Our primary goal will be to study analogies and contrasts among these three parameters. As one example, it is known that the dimension of a poset is bounded as a function of its height and the tree-width of its cover graph. The Boolean dimension of a poset is bounded in terms of the tree-width of its cover graph, independent of its height. We show that the local dimension of a poset cannot be bounded in terms of the tree-width of its cover graph, independent of height. We also…
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.
