A computing procedure for the small inductive dimension of a finite \(\mathrm{T}_0\)-space (Q2342914)

Let \(X= \{x_1, x_2, \dots , x_n\}\) be a finite \(T_0\)-space. If \(U_j\) denotes the smallest neighbourhood of \(x_j\), let \(t_{ij}= 1\) if \(x_i \in U_j\) and \(t_{ij}= 0\) if \(x_i \notin U_j\). \(T = (t_{ij})\) is called the incidence matrix of \(X\). The authors characterize \(\mathrm{ind} X\), the small inductive dimension of \(X\), in terms of its incidence matrix and present an algorithm for computing it. They also give an upper bound on the number of iterations of the algorithm and list a number of open problems.