An Overlap Construction for Relative Linear Extension Ratios

Abstract

Chan and Pak introduced the relative linear extension ratio $ρ(P,x)=e(P)/e(P-x)$, where $e(P)$ is the number of linear extensions of a finite poset $P$, and let $ν(c,d)$ be the least number of elements of a poset that realizes $ρ(P,x)=d/c$. They proved that $ν(c,d)\le d/c+O(\log d\log\log d)$ for $d\ge 3c$, and asked whether the hypothesis $d\ge 3c$ can be relaxed to $d\ge(1+\varepsilon)c$ or removed. We prove the fixed-gap form of this question: for every fixed $\varepsilon>0$, $ν(c,d)\le \frac{d}{c}+O_{\varepsilon}(\log d\log\log d)$ whenever $d\ge(1+\varepsilon)c$, and the implied constant is absolute once $d\ge 2c$. The new ingredient is a one-element overlap construction: if $x$ is minimal in $P$ and $y$ is minimal in $Q$, then there is a poset $R$ with $|R|=|P|+|Q|-1$ and an element $z$ such that $ρ(R,z)=ρ(P,x)+ρ(Q,y)-1$. Together with the continued-fraction construction of Chan and Pak and Rukavishnikova's tail bound for sums of partial quotients, this removes the factor $3$ in their range. We also show that the fixed-gap hypothesis is essentially optimal for this construction. In the range $1 < d/c < 2$, with $h=d-c$, the size bound the construction can certify is at least $\lfloor c/h\rfloor$, so the method reaches the stated error term only when $h$ is at least of order $c/(\log c\log\log c)$. The remaining obstruction to removing the hypothesis is a short-interval problem for sums of partial quotients, which we describe. The deductive part of the argument has been checked with the Lean proof assistant.