摘要
The most important properties of small inductive dimension (ind) are well known (see, for example, Engelking in Theory of dimensions, finite and infinite, 1995 and Pears in Dimension theory of general spaces, 1975). In this paper, we characterize this dimension of a finite -space using matrix algebra. Therefore, using this characterization, we present an algorithm for computing the dimension ind and we compute an upper bound on the number of iterations of the algorithm. Finally, some remarks and open questions are posed.
- 出版日期2015-4