Complexity yardsticks for $f$-vectors of polytopes and spheres

Abstract

We consider geometric and computational measures of complexity for sets of integer vectors, asking for a qualitative difference between $f$-vectors of simplicial and general $d$-polytopes, as well as flag $f$-vectors of $d$-polytopes and regular CW $(d-1)$-spheres, for $d\ge 4$.