Indexed metadata

The Kelly--Trotter conjecture and dimension of poset products

Zhaochen Dong, Kaiyun Wang

Source record

Source: arXiv

Published: Sep 25, 2026

arXiv: 2609.31441

Open original source ↗

Source abstract

We study the order dimension of Cartesian products of finite posets. Kelly and Trotter conjectured in 1982 that dim⁡(P×Q)≥dim⁡P+dim⁡Q−2\dim(P\times Q)\ge\dim P+\dim Q-2 for all finite posets PP and QQ. For m≥3m\ge3, let RmR_m denote the incidence poset of the complete graph on mm vertices. We prove that there is a constant CC such that, for all sufficiently large mm, dim⁡(Rm×Rm)≤(1+2log⁡26)dim⁡Rm+C\dim(R_m\times R_m)\le\left(1+\frac{2}{\log_2 6}\right)\dim R_m+C. Since 1+2/log⁡26<21+2/\log_2 6<2, this disproves the Kelly--Trotter conjecture and shows that 2dim⁡Rm−2−dim⁡(Rm×Rm)2\dim R_m-2-\dim(R_m\times R_m) can grow linearly with dim⁡Rm\dim R_m. For every integer d≥8d\ge8, we construct an incidence poset QdQ_d such that dim⁡Qd=d\dim Q_d=d and QdQ_d has the (3,d)(3,d)-covering property. Consequently, dim⁡(P×Qd)≤dim⁡P+d−3\dim(P\times Q_d)\le\dim P+d-3 for every poset PP with dim⁡P≥3\dim P\ge3. Thus, for every integer d≥8d\ge8, the poset QdQ_d violates the Kelly--Trotter conjecture with every poset of dimension at least 33. Finally, we prove that a poset QQ has an (r,s)(r,s)-covering if and only if dim⁡(Q×Cr)≤s\dim(Q\times C^r)\le s for every finite chain CC with at least two elements.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.