Search arXivSearch

arXiv · 1906.05839

Fractional Local Dimension

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)$ with $2\le d<n$, we consider the poset $P(1,d;n)$ consisting of all $1$-element and $d$-element subsets of $\{1,\dots,n\}$ partially ordered by inclusion. This poset has fractional dimension $d+1$, but for fixed $d\ge2$, its local dimension goes to infinity with $n$. On the other hand, we show that as $n$ tends to infinity, the fractional local dimension of $P(1,d;n)$ tends to a value $\text{FLD}(d)$ which we will be able to determine exactly. For all $d\ge2$, $\text{FLD}(d)$ is strictly less than $d+1$, and for large $d$, $\text{FLD}(d)\sim d/(\log d-\log\log d-o(1))$. As an immediate corollary, we show that if $P$ is a poset, and $d$ is the maximum degree of a vertex in the comparability graph of $P$, then the fractional local dimension of $P$, is at most $2+\text{FLD}(d).$ Our arguments use both discrete and continuous methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Heather C. Smith, William T. Trotter. 2020-10-16. Fractional Local Dimension. https://arxiv.org/abs/1906.05839

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Orthogonal Pairs in Maps from the Sphere to the Circle

We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

math.CO

Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles

For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11}{8};$ equality holds precisely when three areas equal $(3-\sqrt5)/4$ and two equal $(3\sqrt5-5)/8$. For seven triangles, $Δ(7)=r_7$, where $r_7$ is the unique root in $(0,1/4900)$ of $864r^4+2160r^3-6060r^2+4972r-1.$ Every minimizer has four areas $(1+3r_7)/7$ and three areas $(1-4r_7)/7$, although its geometry need not be unique. The proofs combine finite combinatorial classification with exact symbolic and integer-interval certificates. For nine triangles, a tilted-strip construction gives the explicit algebraic upper bound $Δ(9)\le 0.0001273496861283553341\ldots,$ which is the exact minimum within that topology. Conversely, every dissection in the complete single-cap two-rail zig-zag family, with arbitrary continuous areas, has range greater than $1/3500$; hence a global minimizer must lie outside that family. The exact value of $Δ(9)$ remains open.

math.CO

Chromatic symmetric functions for annular webs

We introduce a combinatorial definition of chromatic symmetric functions for annular webs. We prove their symmetry by constructing a web analogue of the Shareshian--Wachs involution and show that they coincide with the symmetric functions associated to annular webs via Turaev's isomorphism. We then derive explicit formulas for their hook Schur coefficients. We also introduce web LLT functions, whose hook Schur coefficients admit positive Laurent-polynomial formulas. These formulas yield a combinatorial expression for the coefficients of the HOMFLY--PT polynomial of an annular web.

math.CO