An Upper Bound for the Depth of Some Classes of Polyhedra
Abstract
K. Borsuk in the seventies introduced the notions of capacity and depth of compacta together with some relevant problems. In this paper, first, we introduce the concepts of the (strong) capacity and the (strong) depth of an object in an arbitrary category. Then in the category of groups, we compute the (strong) capacity and the (strong) depth of some well-known groups. Finally, we find an upper bound for the depth of some classes of finite polyhedra which generalizes a result of D. Kolodziejczyk in this subject.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.