Year: 2011
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Johnson, Hunter
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W149018418