English

Fractional Local Dimension

Combinatorics 2020-10-20 v2

Abstract

The original notion of dimension for posets was introduced by Dushnik and Miller in 1941 and has been studied extensively in the literature. In 1992, Brightwell and Scheinerman developed the notion of fractional dimension as the natural linear programming relaxation of the Dushnik-Miller concept. In 2016, Ueckerdt introduced the concept of local dimension, and in just three years, several research papers studying this new parameter have been published. In this paper, we introduce and study fractional local dimension. As suggested by the terminology, our parameter is a common generalization of fractional dimension and local dimension. For a pair (n,d)(n,d) with 2d<n2\le d<n, we consider the poset P(1,d;n)P(1,d;n) consisting of all 11-element and dd-element subsets of {1,,n}\{1,\dots,n\} partially ordered by inclusion. This poset has fractional dimension d+1d+1, but for fixed d2d\ge2, its local dimension goes to infinity with nn. On the other hand, we show that as nn tends to infinity, the fractional local dimension of P(1,d;n)P(1,d;n) tends to a value FLD(d)\text{FLD}(d) which we will be able to determine exactly. For all d2d\ge2, FLD(d)\text{FLD}(d) is strictly less than d+1d+1, and for large dd, FLD(d)d/(logdloglogdo(1))\text{FLD}(d)\sim d/(\log d-\log\log d-o(1)). As an immediate corollary, we show that if PP is a poset, and dd is the maximum degree of a vertex in the comparability graph of PP, then the fractional local dimension of PP, is at most 2+FLD(d).2+\text{FLD}(d). Our arguments use both discrete and continuous methods.

Keywords

Cite

@article{arxiv.1906.05839,
  title  = {Fractional Local Dimension},
  author = {Heather C. Smith and William T. Trotter},
  journal= {arXiv preprint arXiv:1906.05839},
  year   = {2020}
}
R2 v1 2026-06-23T09:53:05.705Z