English

VC-dimensions Between Partially Ordered Sets and Totally Ordered Sets

Combinatorics 2026-02-10 v3

Abstract

We say that two partial orders on [n][n] are compatible if there exists a partial order that refines both of them. This compatibility relation induces a natural set system structure between the collection F\mathcal{F} of all partial orders and the collection G\mathcal{G} of all total orders on [n][n], where each order is associated with the set of orders compatible with it. In this note, we determine the VC-dimension of F\mathcal{F} with respect to G\mathcal{G}, proving that VCG(F)=n24\operatorname{VC}_{\mathcal{G}}(\mathcal{F}) = \lfloor\frac{n^2}{4}\rfloor for n4n \ge 4. We also establish bounds on the dual VC-dimension, showing that 2(n3)VCF(G)nlog2n2(n-3) \le \operatorname{VC}_{\mathcal{F}}(\mathcal{G}) \le n \log_2 n for all n1n \ge 1.

Keywords

Cite

@article{arxiv.2412.06402,
  title  = {VC-dimensions Between Partially Ordered Sets and Totally Ordered Sets},
  author = {Boyan Duan and Minghui Ouyang and Zheng Wang},
  journal= {arXiv preprint arXiv:2412.06402},
  year   = {2026}
}

Comments

5 pages, 2 figures

R2 v1 2026-06-28T20:27:44.789Z