arXiv Analytics

Sign in

arXiv:1108.4398 [math.LO]AbstractReferencesReviewsResources

VC density and dp rank

Hunter Johnson

Published 2011-08-22, updated 2011-08-25Version 3

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.

Comments: Error in Theorem 4.2
Categories: math.LO, math.CO
Subjects: 12L12, 03C45, 03C98
Related articles: Most relevant | Search more
arXiv:1005.0076 [math.LO] (Published 2010-05-01)
Strong dependence, weight, and measure
arXiv:1108.6315 [math.LO] (Published 2011-08-31, updated 2011-11-07)
Dp-rank and forbidden configurations
arXiv:2103.15799 [math.LO] (Published 2021-03-29)
A note on stability and NIP in one variable

Links

Toolbox