VC density and dp rank
Logic
2011-08-29 v3 Combinatorics
Abstract
We derive that dpR(n) \leq dens(n) \leq dpR(n)+1, where dens(n) is the supremum of the VC density of all formulas in n parameters, and dpR(n) is the maximum depth of an ICT pattern in n variables. Consequently, strong dependence is equivalent to finite VC density.
Cite
@article{arxiv.1108.4398,
title = {VC density and dp rank},
author = {Hunter Johnson},
journal= {arXiv preprint arXiv:1108.4398},
year = {2011}
}
Comments
Error in Theorem 4.2