activity
20112021
most citedDp-rank and forbidden configurations

2 citations · 3 across the 6 of their papers we have counts for

collaborators
Showing 2011Show all

3 papers · 1 filter

math.LO2011

VC density and dp rank

Hunter Johnson

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…

math.LO2011★ 2 cited

Dp-rank and forbidden configurations

Hunter Johnson

A theory is shown to have an ICT pattern of depth in variables $\xbar$ iff it interprets some -maximum VC class in $|\xbar|$ parameters.

math.LO2011

Maximum VC families

Hunter Johnson

Maximum VC classes which are stable in the sense of model theory are characterized.